Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::PlanarSubgraphFast< TCost > Member List

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

BlockType typedefogdf::PlanarSubgraphFast< TCost >private
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::PlanarSubgraphFast< TCost >inlinevirtual
doCall(const Graph &G, const List< edge > &preferedEdges, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferedImplyPlanar) overrideogdf::PlanarSubgraphFast< TCost >inlineprotectedvirtual
doWorkHelper(ThreadMaster &master)ogdf::PlanarSubgraphFast< TCost >inlineprivatestatic
isSolution(ReturnType ret)ogdf::Moduleinlinestatic
isTimeLimit() constogdf::Timeouterinline
m_maxThreadsogdf::PlanarSubgraphModule< TCost >private
m_nRunsogdf::PlanarSubgraphFast< 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
parCall(const Array< BlockType > &block, const EdgeArray< TCost > *pCost, int nRuns, unsigned int nThreads, List< edge > &delEdges)ogdf::PlanarSubgraphFast< TCost >inlineprivate
planarize(const Graph &G, NodeArray< int > &numbering, List< edge > &delEdges)ogdf::PlanarSubgraphFast< TCost >inlineprivatestatic
PlanarSubgraphFast()ogdf::PlanarSubgraphFast< TCost >inline
PlanarSubgraphModule()ogdf::PlanarSubgraphModule< TCost >inline
ReturnType enum nameogdf::Module
runs(int nRuns)ogdf::PlanarSubgraphFast< TCost >inline
runs() constogdf::PlanarSubgraphFast< TCost >inline
seqCall(const Array< BlockType > &block, const EdgeArray< TCost > *pCost, int nRuns, bool randomize, List< edge > &delEdges)ogdf::PlanarSubgraphFast< 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