Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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

This is the complete list of members for ogdf::MaximumPlanarSubgraph< 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
callWithDouble(MaximumCPlanarSubgraph &mc, const Graph &G, const EdgeArray< U > *pCost, List< edge > &delEdges)ogdf::MaximumPlanarSubgraph< TCost >inlineprivate
callWithDouble(MaximumCPlanarSubgraph &mc, const Graph &G, const EdgeArray< double > *pCost, List< edge > &delEdges)ogdf::MaximumPlanarSubgraph< TCost >inlineprivate
clone() const overrideogdf::MaximumPlanarSubgraph< TCost >inlinevirtual
doCall(const Graph &G, const List< edge > &preferredEdges, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferredImplyPlanar) overrideogdf::MaximumPlanarSubgraph< TCost >inlineprotectedvirtual
isSolution(ReturnType ret)ogdf::Moduleinlinestatic
isTimeLimit() constogdf::Timeouterinline
m_maxThreadsogdf::PlanarSubgraphModule< TCost >private
m_timeLimitogdf::Timeouterprotected
MaximumPlanarSubgraph()ogdf::MaximumPlanarSubgraph< TCost >inline
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
PlanarSubgraphModule()ogdf::PlanarSubgraphModule< TCost >inline
ReturnType enum nameogdf::Module
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
~MaximumPlanarSubgraph()ogdf::MaximumPlanarSubgraph< TCost >inlinevirtual
~Module()ogdf::Moduleinlinevirtual
~Timeouter()ogdf::Timeouterinline