Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::MaximumCPlanarSubgraph Member List

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

call(const ClusterGraph &G, List< edge > &delEdges)ogdf::CPlanarSubgraphModuleinline
call(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges)ogdf::CPlanarSubgraphModuleinline
callAndConnect(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges)ogdf::MaximumCPlanarSubgraphinline
CPlanarSubgraphModule()ogdf::CPlanarSubgraphModuleinline
doCall(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges) overrideogdf::MaximumCPlanarSubgraphinlineprotectedvirtual
doCall(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges)ogdf::MaximumCPlanarSubgraphprotectedvirtual
getBottomUpClusterList(const cluster c, List< cluster > &theList)ogdf::MaximumCPlanarSubgraphprotected
getDoubleTime(const Stopwatch &act)ogdf::MaximumCPlanarSubgraphinlineprotected
getHeurTime()ogdf::MaximumCPlanarSubgraphinline
getIeqFileName()ogdf::MaximumCPlanarSubgraphinlineprivate
getLPSolverTime()ogdf::MaximumCPlanarSubgraphinline
getLPTime()ogdf::MaximumCPlanarSubgraphinline
getNumBCs()ogdf::MaximumCPlanarSubgraphinline
getNumCCons()ogdf::MaximumCPlanarSubgraphinline
getNumKCons()ogdf::MaximumCPlanarSubgraphinline
getNumLPs()ogdf::MaximumCPlanarSubgraphinline
getNumSubSelected()ogdf::MaximumCPlanarSubgraphinline
getNumVars()ogdf::MaximumCPlanarSubgraphinline
getPortaFileName()ogdf::MaximumCPlanarSubgraphinlineprivate
getSeparationTime()ogdf::MaximumCPlanarSubgraphinline
getSolByHeuristic()ogdf::MaximumCPlanarSubgraphinline
getTotalTime()ogdf::MaximumCPlanarSubgraphinline
getTotalWTime()ogdf::MaximumCPlanarSubgraphinline
isSolution(ReturnType ret)ogdf::Moduleinlinestatic
isTimeLimit() constogdf::Timeouterinline
m_branchingGapogdf::MaximumCPlanarSubgraphprivate
m_checkCPlanarogdf::MaximumCPlanarSubgraphprivate
m_defaultCutPoologdf::MaximumCPlanarSubgraphprivate
m_heuristicLevelogdf::MaximumCPlanarSubgraphprivate
m_heuristicNPermListsogdf::MaximumCPlanarSubgraphprivate
m_heuristicOEdgeBoundogdf::MaximumCPlanarSubgraphprivate
m_heuristicRunsogdf::MaximumCPlanarSubgraphprivate
m_heurTimeogdf::MaximumCPlanarSubgraphprivate
m_kSupportGraphsogdf::MaximumCPlanarSubgraphprivate
m_kuratowskiHighogdf::MaximumCPlanarSubgraphprivate
m_kuratowskiIterationsogdf::MaximumCPlanarSubgraphprivate
m_kuratowskiLowogdf::MaximumCPlanarSubgraphprivate
m_lpSolverTimeogdf::MaximumCPlanarSubgraphprivate
m_lpTimeogdf::MaximumCPlanarSubgraphprivate
m_numAddVariablesogdf::MaximumCPlanarSubgraphprivate
m_numBCsogdf::MaximumCPlanarSubgraphprivate
m_numCConsogdf::MaximumCPlanarSubgraphprivate
m_numKConsogdf::MaximumCPlanarSubgraphprivate
m_numLPsogdf::MaximumCPlanarSubgraphprivate
m_numSubSelectedogdf::MaximumCPlanarSubgraphprivate
m_numVarsogdf::MaximumCPlanarSubgraphprivate
m_perturbationogdf::MaximumCPlanarSubgraphprivate
m_portaOutputogdf::MaximumCPlanarSubgraphprivate
m_pricingogdf::MaximumCPlanarSubgraphprivate
m_sepTimeogdf::MaximumCPlanarSubgraphprivate
m_solByHeuristicogdf::MaximumCPlanarSubgraphprivate
m_strongConstraintViolationogdf::MaximumCPlanarSubgraphprivate
m_strongVariableViolationogdf::MaximumCPlanarSubgraphprivate
m_subdivisionsogdf::MaximumCPlanarSubgraphprivate
m_timeogdf::MaximumCPlanarSubgraphprivate
m_timeLimitogdf::Timeouterprotected
m_totalTimeogdf::MaximumCPlanarSubgraphprivate
m_totalWTimeogdf::MaximumCPlanarSubgraphprivate
maxConLength()ogdf::MaximumCPlanarSubgraphinlineprivate
MaxCPlanarMaster typedefogdf::MaximumCPlanarSubgraph
MaximumCPlanarSubgraph()ogdf::MaximumCPlanarSubgraphinline
Module()ogdf::Moduleinline
NodePairs typedefogdf::MaximumCPlanarSubgraph
operator=(const Timeouter &t)ogdf::Timeouterinline
outputCons(std::ofstream &os, abacus::StandardPool< abacus::Constraint, abacus::Variable > *connCon, abacus::StandardPool< abacus::Variable, abacus::Constraint > *stdVar)ogdf::MaximumCPlanarSubgraphprivate
ReturnType enum nameogdf::Module
setBranchingGap(double d)ogdf::MaximumCPlanarSubgraphinline
setCheckCPlanar(bool b)ogdf::MaximumCPlanarSubgraphinline
setHeuristicBound(double d)ogdf::MaximumCPlanarSubgraphinline
setHeuristicLevel(int i)ogdf::MaximumCPlanarSubgraphinline
setHeuristicRuns(int i)ogdf::MaximumCPlanarSubgraphinline
setLowerRounding(double d)ogdf::MaximumCPlanarSubgraphinline
setNumAddVariables(int n)ogdf::MaximumCPlanarSubgraphinline
setNumberOfKuraIterations(int i)ogdf::MaximumCPlanarSubgraphinline
setNumberOfPermutations(int i)ogdf::MaximumCPlanarSubgraphinline
setNumberOfSubDivisions(int i)ogdf::MaximumCPlanarSubgraphinline
setNumberOfSupportGraphs(int i)ogdf::MaximumCPlanarSubgraphinline
setPerturbation(bool b)ogdf::MaximumCPlanarSubgraphinline
setPortaOutput(bool b)ogdf::MaximumCPlanarSubgraphinline
setPricing(bool b)ogdf::MaximumCPlanarSubgraphinline
setStrongConstraintViolation(double d)ogdf::MaximumCPlanarSubgraphinline
setStrongVariableViolation(double d)ogdf::MaximumCPlanarSubgraphinline
setTimeLimit(string s)ogdf::MaximumCPlanarSubgraphinline
setTimeLimit(std::chrono::milliseconds milliSec)ogdf::MaximumCPlanarSubgraphinline
setUpperRounding(double d)ogdf::MaximumCPlanarSubgraphinline
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
useDefaultCutPool()ogdf::MaximumCPlanarSubgraphinline
writeFeasible(const char *filename, MaxCPlanarMaster &master, abacus::Master::STATUS &status)ogdf::MaximumCPlanarSubgraph
~CPlanarSubgraphModule()ogdf::CPlanarSubgraphModuleinlinevirtual
~MaximumCPlanarSubgraph()ogdf::MaximumCPlanarSubgraphinline
~Module()ogdf::Moduleinlinevirtual
~Timeouter()ogdf::Timeouterinline