Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::CrossingMinimizationModule Member List

This is the complete list of members for ogdf::CrossingMinimizationModule, including all inherited members.

call(PlanRep &pr, int cc, int &crossingNumber, const EdgeArray< int > *pCostOrig=nullptr, const EdgeArray< bool > *pForbiddenOrig=nullptr, const EdgeArray< uint32_t > *pEdgeSubGraphs=nullptr)ogdf::CrossingMinimizationModuleinline
clone() const =0ogdf::CrossingMinimizationModulepure virtual
computeCrossingNumber(GraphCopy &graphCopy, const EdgeArray< int > *pCost, const EdgeArray< uint32_t > *pEdgeSubGraphs)ogdf::CrossingMinimizationModuleinlineprotectedstatic
CrossingMinimizationModule()ogdf::CrossingMinimizationModuleinline
CrossingMinimizationModule(const CrossingMinimizationModule &cmm)ogdf::CrossingMinimizationModuleinline
doCall(PlanRep &pr, int cc, const EdgeArray< int > *pCostOrig, const EdgeArray< bool > *pForbiddenOrig, const EdgeArray< uint32_t > *pEdgeSubGraphs, int &crossingNumber)=0ogdf::CrossingMinimizationModuleprotectedpure virtual
isSolution(ReturnType ret)ogdf::Moduleinlinestatic
isTimeLimit() constogdf::Timeouterinline
m_timeLimitogdf::Timeouterprotected
Module()ogdf::Moduleinline
operator()(PlanRep &pr, int cc, int &crossingNumber, const EdgeArray< int > *pCostOrig=nullptr, const EdgeArray< bool > *pForbiddenOrig=nullptr, const EdgeArray< uint32_t > *pEdgeSubGraphs=nullptr)ogdf::CrossingMinimizationModuleinline
operator=(const Timeouter &t)ogdf::Timeouterinline
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
~CrossingMinimizationModule()ogdf::CrossingMinimizationModuleinlinevirtual
~Module()ogdf::Moduleinlinevirtual
~Timeouter()ogdf::Timeouterinline