| adjEntry_iterator typedef | ogdf::Graph | |
| adjEntryArrayTableSize() const | ogdf::Graph | inline |
| allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
| allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| chain(edge eOrig) const | ogdf::PlanRepExpansion | inline |
| chooseEdge(std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
| chooseNode(std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const | ogdf::Graph | |
| clear() | ogdf::Graph | virtual |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
| computeNumberOfCrossings() const | ogdf::PlanRepExpansion | |
| construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByCC(const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByNodes(const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
| contractSplit(nodeSplit ns, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| contractSplit(nodeSplit ns) | ogdf::PlanRepExpansion | |
| convertDummy(node u, node vOrig, PlanRepExpansion::nodeSplit ns) | ogdf::PlanRepExpansion | |
| copy(node vOrig) const | ogdf::PlanRepExpansion | inline |
| copy(edge eOrig) const | ogdf::PlanRepExpansion | inline |
| createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) | ogdf::Graph | private |
| currentCC() const | ogdf::PlanRepExpansion | inline |
| delEdge(edge e) override | ogdf::PlanRepExpansion | virtual |
| delNode(node v) | ogdf::Graph | virtual |
| doInit(const Graph &G, const List< node > &splittableNodes) | ogdf::PlanRepExpansion | private |
| edge_iterator typedef | ogdf::Graph | |
| edgeArrayTableSize() const | ogdf::Graph | inline |
| edges | ogdf::Graph | |
| EdgeType enum name | ogdf::Graph | |
| embed() | ogdf::PlanRepExpansion | |
| empty() const | ogdf::Graph | inline |
| enlargeSplit(node v, edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| enlargeSplit(node v, edge e) | ogdf::PlanRepExpansion | |
| expansion(node vOrig) const | ogdf::PlanRepExpansion | inline |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| genus() const | ogdf::Graph | |
| Graph() | ogdf::Graph | |
| Graph(const Graph &G) | ogdf::Graph | |
| initCC(int i) | ogdf::PlanRepExpansion | |
| insert(const Graph &G, NodeArray< node > &nodeMap) | ogdf::Graph | |
| insert(const Graph &G) | ogdf::Graph | |
| insertEdgePath(edge eOrig, nodeSplit ns, node vStart, node vEnd, List< Crossing > &eip, edge eSrc, edge eTgt) | ogdf::PlanRepExpansion | |
| insertEdgePathEmbedded(edge eOrig, nodeSplit ns, CombinatorialEmbedding &E, const List< Tuple2< adjEntry, adjEntry > > &crossedEdges) | ogdf::PlanRepExpansion | |
| isPseudoCrossing(node v) const | ogdf::PlanRepExpansion | |
| lastEdge() const | ogdf::Graph | inline |
| lastNode() const | ogdf::Graph | inline |
| m_currentCC | ogdf::PlanRepExpansion | private |
| m_eAuxCopy | ogdf::PlanRepExpansion | private |
| m_eCopy | ogdf::PlanRepExpansion | private |
| m_edgeArrayTableSize | ogdf::Graph | private |
| m_edgeIdCount | ogdf::Graph | private |
| m_eIterator | ogdf::PlanRepExpansion | private |
| m_eNodeSplit | ogdf::PlanRepExpansion | private |
| m_eOrig | ogdf::PlanRepExpansion | private |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_mutexRegArrays | ogdf::Graph | mutableprivate |
| m_nodeArrayTableSize | ogdf::Graph | private |
| m_nodeIdCount | ogdf::Graph | private |
| m_nodesInCC | ogdf::PlanRepExpansion | private |
| m_nodeSplits | ogdf::PlanRepExpansion | private |
| m_numCC | ogdf::PlanRepExpansion | private |
| m_pGraph | ogdf::PlanRepExpansion | private |
| m_regAdjArrays | ogdf::Graph | mutableprivate |
| m_regEdgeArrays | ogdf::Graph | mutableprivate |
| m_regNodeArrays | ogdf::Graph | mutableprivate |
| m_regStructures | ogdf::Graph | mutableprivate |
| m_splittable | ogdf::PlanRepExpansion | private |
| m_splittableOrig | ogdf::PlanRepExpansion | private |
| m_vCopy | ogdf::PlanRepExpansion | private |
| m_vIterator | ogdf::PlanRepExpansion | private |
| m_vOrig | ogdf::PlanRepExpansion | private |
| maxAdjEntryIndex() const | ogdf::Graph | inline |
| maxEdgeIndex() const | ogdf::Graph | inline |
| maxNodeIndex() const | ogdf::Graph | inline |
| move(edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt) | ogdf::Graph | |
| moveAdj(adjEntry adjMove, Direction dir, adjEntry adjPos) | ogdf::Graph | inline |
| moveAdj(adjEntry adj, node w) | ogdf::Graph | private |
| moveAdjAfter(adjEntry adjMove, adjEntry adjAfter) | ogdf::Graph | inline |
| moveAdjBefore(adjEntry adjMove, adjEntry adjBefore) | ogdf::Graph | inline |
| moveRegisterArray(ListIterator< ArrayBase * > it, ArrayBase *pArray) const | ogdf::Graph | inline |
| moveSource(edge e, node w) | ogdf::Graph | |
| moveSource(edge e, adjEntry adjSrc, Direction dir) | ogdf::Graph | |
| moveTarget(edge e, node w) | ogdf::Graph | |
| moveTarget(edge e, adjEntry adjTgt, Direction dir) | ogdf::Graph | |
| newEdge(node v, node w) | ogdf::Graph | |
| newEdge(node v, node w, int index) | ogdf::Graph | |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after) | ogdf::Graph | |
| newEdge(node v, adjEntry adjTgt) | ogdf::Graph | |
| newEdge(adjEntry adjSrc, node w) | ogdf::Graph | |
| newNode() | ogdf::Graph | |
| newNode(int index) | ogdf::Graph | |
| node_iterator typedef | ogdf::Graph | |
| nodeArrayTableSize() const | ogdf::Graph | inline |
| nodes | ogdf::Graph | |
| nodesInCC(int i) const | ogdf::PlanRepExpansion | inline |
| nodesInCC() const | ogdf::PlanRepExpansion | inline |
| nodeSplit typedef | ogdf::PlanRepExpansion | |
| nodeSplitOf(edge e) const | ogdf::PlanRepExpansion | inline |
| nodeSplits() | ogdf::PlanRepExpansion | inline |
| NodeType enum name | ogdf::Graph | |
| numberOfCCs() const | ogdf::PlanRepExpansion | inline |
| numberOfEdges() const | ogdf::Graph | inline |
| numberOfNodes() const | ogdf::Graph | inline |
| numberOfNodeSplits() const | ogdf::PlanRepExpansion | inline |
| numberOfSplittedNodes() const | ogdf::PlanRepExpansion | |
| operator=(const Graph &G) | ogdf::Graph | |
| original() const | ogdf::PlanRepExpansion | inline |
| original(node v) const | ogdf::PlanRepExpansion | inline |
| originalEdge(edge e) const | ogdf::PlanRepExpansion | inline |
| PlanRepExpansion(const Graph &G) | ogdf::PlanRepExpansion | |
| PlanRepExpansion(const Graph &G, const List< node > &splittableNodes) | ogdf::PlanRepExpansion | |
| position(edge e) const | ogdf::PlanRepExpansion | inline |
| prepareNodeSplit(const SList< adjEntry > &partitionLeft, adjEntry &adjLeft, adjEntry &adjRight) | ogdf::PlanRepExpansion | private |
| pureNewNode() | ogdf::Graph | private |
| registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | |
| registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | |
| registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | |
| registerStructure(GraphObserver *pStructure) const | ogdf::Graph | |
| reinitArrays(bool doResetTableSizes=true) | ogdf::Graph | private |
| removeEdgePath(edge eOrig, nodeSplit ns, node &oldSrc, node &oldTgt) | ogdf::PlanRepExpansion | |
| removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, nodeSplit ns, FaceSet< false > &newFaces, NodeSet< false > &mergedNodes, node &oldSrc, node &oldTgt) | ogdf::PlanRepExpansion | |
| removeSelfLoop(edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| removeSelfLoop(edge e) | ogdf::PlanRepExpansion | |
| representsCombEmbedding() const | ogdf::Graph | inline |
| resetAdjEntryIndex(int newIndex, int oldIndex) | ogdf::Graph | private |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resetTableSizes() | ogdf::Graph | private |
| resolvePseudoCrossing(node v) | ogdf::PlanRepExpansion | |
| restoreAllEdges() | ogdf::Graph | private |
| reverseAdjEdges(node v) | ogdf::Graph | inline |
| reverseAdjEdges() | ogdf::Graph | |
| reverseAllEdges() | ogdf::Graph | |
| reverseEdge(edge e) | ogdf::Graph | |
| searchEdge(node v, node w, bool directed=false) const | ogdf::Graph | |
| separateDummy(adjEntry adj_1, adjEntry adj_2, node vStraight, bool isSrc) | ogdf::PlanRepExpansion | |
| setOrigs(edge e, edge &eOrig, nodeSplit &ns) | ogdf::PlanRepExpansion | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
| split(edge e) override | ogdf::PlanRepExpansion | virtual |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| splitNodeSplit(edge e, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| splitNodeSplit(edge e) | ogdf::PlanRepExpansion | |
| splittable(node v) const | ogdf::PlanRepExpansion | inline |
| splittableOrig(node vOrig) const | ogdf::PlanRepExpansion | inline |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
| unregisterArray(ListIterator< NodeArrayBase * > it) const | ogdf::Graph | |
| unregisterArray(ListIterator< EdgeArrayBase * > it) const | ogdf::Graph | |
| unregisterArray(ListIterator< AdjEntryArrayBase * > it) const | ogdf::Graph | |
| unregisterStructure(ListIterator< GraphObserver * > it) const | ogdf::Graph | |
| unsplit(edge eIn, edge eOut) override | ogdf::PlanRepExpansion | virtual |
| ogdf::Graph::unsplit(node u) | ogdf::Graph | |
| unsplitExpandNode(node u, edge eContract, edge eExpand, CombinatorialEmbedding &E) | ogdf::PlanRepExpansion | |
| unsplitExpandNode(node u, edge eContract, edge eExpand) | ogdf::PlanRepExpansion | |
| ~Graph() | ogdf::Graph | virtual |
| ~PlanRepExpansion() | ogdf::PlanRepExpansion | inline |
