| call(const ClusterGraph &G, List< edge > &delEdges) | ogdf::CPlanarSubgraphModule | inline |
| call(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges) | ogdf::CPlanarSubgraphModule | inline |
| callAndConnect(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges) | ogdf::MaximumCPlanarSubgraph | inline |
| CPlanarSubgraphModule() | ogdf::CPlanarSubgraphModule | inline |
| doCall(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges) override | ogdf::MaximumCPlanarSubgraph | inlineprotectedvirtual |
| doCall(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges, NodePairs &addedEdges) | ogdf::MaximumCPlanarSubgraph | protectedvirtual |
| getBottomUpClusterList(const cluster c, List< cluster > &theList) | ogdf::MaximumCPlanarSubgraph | protected |
| getDoubleTime(const Stopwatch &act) | ogdf::MaximumCPlanarSubgraph | inlineprotected |
| getHeurTime() | ogdf::MaximumCPlanarSubgraph | inline |
| getIeqFileName() | ogdf::MaximumCPlanarSubgraph | inlineprivate |
| getLPSolverTime() | ogdf::MaximumCPlanarSubgraph | inline |
| getLPTime() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumBCs() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumCCons() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumKCons() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumLPs() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumSubSelected() | ogdf::MaximumCPlanarSubgraph | inline |
| getNumVars() | ogdf::MaximumCPlanarSubgraph | inline |
| getPortaFileName() | ogdf::MaximumCPlanarSubgraph | inlineprivate |
| getSeparationTime() | ogdf::MaximumCPlanarSubgraph | inline |
| getSolByHeuristic() | ogdf::MaximumCPlanarSubgraph | inline |
| getTotalTime() | ogdf::MaximumCPlanarSubgraph | inline |
| getTotalWTime() | ogdf::MaximumCPlanarSubgraph | inline |
| isSolution(ReturnType ret) | ogdf::Module | inlinestatic |
| isTimeLimit() const | ogdf::Timeouter | inline |
| m_branchingGap | ogdf::MaximumCPlanarSubgraph | private |
| m_checkCPlanar | ogdf::MaximumCPlanarSubgraph | private |
| m_defaultCutPool | ogdf::MaximumCPlanarSubgraph | private |
| m_heuristicLevel | ogdf::MaximumCPlanarSubgraph | private |
| m_heuristicNPermLists | ogdf::MaximumCPlanarSubgraph | private |
| m_heuristicOEdgeBound | ogdf::MaximumCPlanarSubgraph | private |
| m_heuristicRuns | ogdf::MaximumCPlanarSubgraph | private |
| m_heurTime | ogdf::MaximumCPlanarSubgraph | private |
| m_kSupportGraphs | ogdf::MaximumCPlanarSubgraph | private |
| m_kuratowskiHigh | ogdf::MaximumCPlanarSubgraph | private |
| m_kuratowskiIterations | ogdf::MaximumCPlanarSubgraph | private |
| m_kuratowskiLow | ogdf::MaximumCPlanarSubgraph | private |
| m_lpSolverTime | ogdf::MaximumCPlanarSubgraph | private |
| m_lpTime | ogdf::MaximumCPlanarSubgraph | private |
| m_numAddVariables | ogdf::MaximumCPlanarSubgraph | private |
| m_numBCs | ogdf::MaximumCPlanarSubgraph | private |
| m_numCCons | ogdf::MaximumCPlanarSubgraph | private |
| m_numKCons | ogdf::MaximumCPlanarSubgraph | private |
| m_numLPs | ogdf::MaximumCPlanarSubgraph | private |
| m_numSubSelected | ogdf::MaximumCPlanarSubgraph | private |
| m_numVars | ogdf::MaximumCPlanarSubgraph | private |
| m_perturbation | ogdf::MaximumCPlanarSubgraph | private |
| m_portaOutput | ogdf::MaximumCPlanarSubgraph | private |
| m_pricing | ogdf::MaximumCPlanarSubgraph | private |
| m_sepTime | ogdf::MaximumCPlanarSubgraph | private |
| m_solByHeuristic | ogdf::MaximumCPlanarSubgraph | private |
| m_strongConstraintViolation | ogdf::MaximumCPlanarSubgraph | private |
| m_strongVariableViolation | ogdf::MaximumCPlanarSubgraph | private |
| m_subdivisions | ogdf::MaximumCPlanarSubgraph | private |
| m_time | ogdf::MaximumCPlanarSubgraph | private |
| m_timeLimit | ogdf::Timeouter | protected |
| m_totalTime | ogdf::MaximumCPlanarSubgraph | private |
| m_totalWTime | ogdf::MaximumCPlanarSubgraph | private |
| maxConLength() | ogdf::MaximumCPlanarSubgraph | inlineprivate |
| MaxCPlanarMaster typedef | ogdf::MaximumCPlanarSubgraph | |
| MaximumCPlanarSubgraph() | ogdf::MaximumCPlanarSubgraph | inline |
| Module() | ogdf::Module | inline |
| NodePairs typedef | ogdf::MaximumCPlanarSubgraph | |
| operator=(const Timeouter &t) | ogdf::Timeouter | inline |
| outputCons(std::ofstream &os, abacus::StandardPool< abacus::Constraint, abacus::Variable > *connCon, abacus::StandardPool< abacus::Variable, abacus::Constraint > *stdVar) | ogdf::MaximumCPlanarSubgraph | private |
| ReturnType enum name | ogdf::Module | |
| setBranchingGap(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| setCheckCPlanar(bool b) | ogdf::MaximumCPlanarSubgraph | inline |
| setHeuristicBound(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| setHeuristicLevel(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setHeuristicRuns(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setLowerRounding(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| setNumAddVariables(int n) | ogdf::MaximumCPlanarSubgraph | inline |
| setNumberOfKuraIterations(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setNumberOfPermutations(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setNumberOfSubDivisions(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setNumberOfSupportGraphs(int i) | ogdf::MaximumCPlanarSubgraph | inline |
| setPerturbation(bool b) | ogdf::MaximumCPlanarSubgraph | inline |
| setPortaOutput(bool b) | ogdf::MaximumCPlanarSubgraph | inline |
| setPricing(bool b) | ogdf::MaximumCPlanarSubgraph | inline |
| setStrongConstraintViolation(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| setStrongVariableViolation(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| setTimeLimit(string s) | ogdf::MaximumCPlanarSubgraph | inline |
| setTimeLimit(std::chrono::milliseconds milliSec) | ogdf::MaximumCPlanarSubgraph | inline |
| setUpperRounding(double d) | ogdf::MaximumCPlanarSubgraph | inline |
| timeLimit(double t) | ogdf::Timeouter | inline |
| timeLimit(bool t) | ogdf::Timeouter | inline |
| timeLimit() const | ogdf::Timeouter | inline |
| Timeouter() | ogdf::Timeouter | inline |
| Timeouter(double t) | ogdf::Timeouter | inlineexplicit |
| Timeouter(bool t) | ogdf::Timeouter | inlineexplicit |
| Timeouter(const Timeouter &t) | ogdf::Timeouter | inline |
| useDefaultCutPool() | ogdf::MaximumCPlanarSubgraph | inline |
| writeFeasible(const char *filename, MaxCPlanarMaster &master, abacus::Master::STATUS &status) | ogdf::MaximumCPlanarSubgraph | |
| ~CPlanarSubgraphModule() | ogdf::CPlanarSubgraphModule | inlinevirtual |
| ~MaximumCPlanarSubgraph() | ogdf::MaximumCPlanarSubgraph | inline |
| ~Module() | ogdf::Module | inlinevirtual |
| ~Timeouter() | ogdf::Timeouter | inline |
