| call(PlanRepExpansion &PG, int cc, int &crossingNumber, const EdgeArray< bool > *forbid=nullptr) | ogdf::MMCrossingMinimizationModule | inline |
| call(const Graph &G, int &cr, const EdgeArray< bool > *forbid=nullptr) | ogdf::MMCrossingMinimizationModule | |
| call(const Graph &G, const List< node > &splittableNodes, int &cr, const EdgeArray< bool > *forbid=nullptr) | ogdf::MMCrossingMinimizationModule | |
| doCall(PlanRepExpansion &PG, int cc, const EdgeArray< bool > *forbid, int &crossingNumber, int &numNS, int &numSN) override | ogdf::MMSubgraphPlanarizer | protectedvirtual |
| isSolution(ReturnType ret) | ogdf::Module | inlinestatic |
| m_inserter | ogdf::MMSubgraphPlanarizer | private |
| m_nodeSplits | ogdf::MMCrossingMinimizationModule | private |
| m_permutations | ogdf::MMSubgraphPlanarizer | private |
| m_splittedNodes | ogdf::MMCrossingMinimizationModule | private |
| m_subgraph | ogdf::MMSubgraphPlanarizer | private |
| MMCrossingMinimizationModule() | ogdf::MMCrossingMinimizationModule | inline |
| MMSubgraphPlanarizer() | ogdf::MMSubgraphPlanarizer | |
| Module() | ogdf::Module | inline |
| numberOfNodeSplits() const | ogdf::MMCrossingMinimizationModule | inline |
| numberOfSplittedNodes() const | ogdf::MMCrossingMinimizationModule | inline |
| permutations() | ogdf::MMSubgraphPlanarizer | inline |
| permutations(int p) | ogdf::MMSubgraphPlanarizer | inline |
| ReturnType enum name | ogdf::Module | |
| setInserter(MMEdgeInsertionModule *pInserter) | ogdf::MMSubgraphPlanarizer | inline |
| setSubgraph(PlanarSubgraphModule< int > *pSubgraph) | ogdf::MMSubgraphPlanarizer | inline |
| ~MMCrossingMinimizationModule() | ogdf::MMCrossingMinimizationModule | inlinevirtual |
| ~Module() | ogdf::Module | inlinevirtual |
