| constructDual(const Graph &G, const CombinatorialEmbedding &E, bool forbidCrossings=true) | ogdf::SimpleIncNodeInserter | protected |
| findShortestPath(const CombinatorialEmbedding &E, node s, node t, Graph::EdgeType eType, SList< adjEntry > &crossed) | ogdf::SimpleIncNodeInserter | protected |
| getInsertionFace(node v, CombinatorialEmbedding &E) override | ogdf::SimpleIncNodeInserter | protectedvirtual |
| IncNodeInserter(PlanRepInc &PG) | ogdf::IncNodeInserter | inlineexplicit |
| insertCopyNode(node v, CombinatorialEmbedding &E, Graph::NodeType vTyp) override | ogdf::SimpleIncNodeInserter | virtual |
| insertCopyNode(node v, Graph::NodeType vTyp) | ogdf::SimpleIncNodeInserter | |
| insertCrossingEdges(node v, node vCopy, CombinatorialEmbedding &E, adjEntry &adExternal) | ogdf::SimpleIncNodeInserter | protected |
| insertEdge(CombinatorialEmbedding &E, edge eOrig, const SList< adjEntry > &crossed, bool forbidCrossingGens) | ogdf::SimpleIncNodeInserter | protected |
| insertFaceEdges(node v, node vCopy, face f, CombinatorialEmbedding &E, adjEntry &adExternal) | ogdf::SimpleIncNodeInserter | protected |
| m_dual | ogdf::SimpleIncNodeInserter | private |
| m_forbidCrossings | ogdf::SimpleIncNodeInserter | private |
| m_incidentEdges | ogdf::SimpleIncNodeInserter | private |
| m_insertFaceNode | ogdf::SimpleIncNodeInserter | private |
| m_nodeOf | ogdf::SimpleIncNodeInserter | private |
| m_planRep | ogdf::IncNodeInserter | protected |
| m_primalAdj | ogdf::SimpleIncNodeInserter | private |
| m_primalIsGen | ogdf::SimpleIncNodeInserter | private |
| m_vAdjNodes | ogdf::SimpleIncNodeInserter | private |
| m_vS | ogdf::SimpleIncNodeInserter | private |
| m_vT | ogdf::SimpleIncNodeInserter | private |
| SimpleIncNodeInserter(PlanRepInc &PG) | ogdf::SimpleIncNodeInserter | explicit |
| updateComponentNumber(node vCopy, node wCopy, CombinatorialEmbedding &E, adjEntry adExternal) | ogdf::SimpleIncNodeInserter | inlineprivate |
| ~SimpleIncNodeInserter() | ogdf::SimpleIncNodeInserter | virtual |