Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::PlanarSubgraphCactus< TCost > Member List

This is the complete list of members for ogdf::PlanarSubgraphCactus< TCost >, including all inherited members.

call(const Graph &G, const EdgeArray< TCost > &cost, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)ogdf::PlanarSubgraphModule< TCost >inline
call(const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)ogdf::PlanarSubgraphModule< TCost >inline
call(const Graph &G, const EdgeArray< TCost > &cost, List< edge > &delEdges)ogdf::PlanarSubgraphModule< TCost >inline
call(const Graph &G, List< edge > &delEdges)ogdf::PlanarSubgraphModule< TCost >inline
callAndDelete(GraphCopy &GC, const List< edge > &preferredEdges, List< edge > &delOrigEdges, bool preferredImplyPlanar=false)ogdf::PlanarSubgraphModule< TCost >inline
callAndDelete(GraphCopy &GC, List< edge > &delOrigEdges)ogdf::PlanarSubgraphModule< TCost >inline
clone() const overrideogdf::PlanarSubgraphCactus< TCost >inlinevirtual
doCall(const Graph &graph, const List< edge > &, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferredImplyPlanar=false) overrideogdf::PlanarSubgraphTriangles< TCost >inlineprotectedvirtual
findTriangle(GraphCopy &copy, edge currentEdge, const EdgeArray< TCost > *pCost, DisjointSets<> &components, NodeArray< int > &set, std::function< bool(node, edge, edge)> callback)ogdf::PlanarSubgraphTriangles< TCost >inlineprivate
isSolution(ReturnType ret)ogdf::Moduleinlinestatic
isTimeLimit() constogdf::Timeouterinline
m_maxThreadsogdf::PlanarSubgraphModule< TCost >private
m_onlyTrianglesogdf::PlanarSubgraphTriangles< TCost >private
m_timeLimitogdf::Timeouterprotected
maxThreads() constogdf::PlanarSubgraphModule< TCost >inline
maxThreads(unsigned int n)ogdf::PlanarSubgraphModule< TCost >inline
Module()ogdf::Moduleinline
operator()(const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, bool preferredImplyPlanar=false)ogdf::PlanarSubgraphModule< TCost >inline
operator()(const Graph &G, List< edge > &delEdges)ogdf::PlanarSubgraphModule< TCost >inline
operator=(const Timeouter &t)ogdf::Timeouterinline
PlanarSubgraphCactus()ogdf::PlanarSubgraphCactus< TCost >inline
PlanarSubgraphModule()ogdf::PlanarSubgraphModule< TCost >inline
PlanarSubgraphTriangles(bool onlyTriangles=false)ogdf::PlanarSubgraphTriangles< TCost >inline
ReturnType enum nameogdf::Module
searchEdge(node target, node source, internal::GraphIterator< adjEntry > connectionIterator)ogdf::PlanarSubgraphTriangles< TCost >inlineprivate
timeLimit(double t)ogdf::Timeouterinline
timeLimit(bool t)ogdf::Timeouterinline
timeLimit() constogdf::Timeouterinline
Timeouter()ogdf::Timeouterinline
Timeouter(double t)ogdf::Timeouterinlineexplicit
Timeouter(bool t)ogdf::Timeouterinlineexplicit
Timeouter(const Timeouter &t)ogdf::Timeouterinline
~Module()ogdf::Moduleinlinevirtual
~Timeouter()ogdf::Timeouterinline