| 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 e) const | ogdf::GraphCopy | 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() override | ogdf::GraphCopy | virtual |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
| 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 | |
| copy(node v) const | ogdf::GraphCopy | inline |
| copy(edge e) const | ogdf::GraphCopy | inline |
| copy(adjEntry adj) const | ogdf::GraphCopy | inline |
| createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) | ogdf::Graph | private |
| createEmpty(const Graph &wG) | ogdf::EdgeWeightedGraphCopy< T > | |
| delEdge(edge e) override | ogdf::GraphCopy | virtual |
| delNode(node v) override | ogdf::GraphCopy | virtual |
| edge_iterator typedef | ogdf::Graph | |
| edgeArrayTableSize() const | ogdf::Graph | inline |
| edges | ogdf::Graph | |
| EdgeType enum name | ogdf::Graph | |
| EdgeWeightedGraphCopy() | ogdf::EdgeWeightedGraphCopy< T > | inline |
| EdgeWeightedGraphCopy(const EdgeWeightedGraph< T > &wC) | ogdf::EdgeWeightedGraphCopy< T > | explicit |
| EdgeWeightedGraphCopy(const EdgeWeightedGraphCopy &wGC) | ogdf::EdgeWeightedGraphCopy< T > | |
| edgeWeights() const | ogdf::EdgeWeightedGraphCopy< T > | inline |
| embed() | ogdf::GraphCopy | |
| empty() const | ogdf::Graph | inline |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| genus() const | ogdf::Graph | |
| Graph() | ogdf::Graph | |
| Graph(const Graph &G) | ogdf::Graph | |
| GraphCopy(const Graph &G) | ogdf::GraphCopy | explicit |
| GraphCopy() | ogdf::GraphCopy | inline |
| GraphCopy(const GraphCopy &GC) | ogdf::GraphCopy | |
| hasAdjacentEdgesCrossings() const | ogdf::GraphCopy | |
| hasNonSimpleCrossings() const | ogdf::GraphCopy | inline |
| hasSameEdgesCrossings() const | ogdf::GraphCopy | |
| init(const EdgeWeightedGraph< T > &wG) | ogdf::EdgeWeightedGraphCopy< T > | |
| ogdf::GraphCopy::init(const Graph &G) | ogdf::GraphCopy | |
| initByActiveNodes(const List< node > &nodeList, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | |
| initByCC(const CCsInfo &info, int cc, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | |
| initByNodes(const List< node > &origNodes, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | |
| initGC(const GraphCopy &GC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy) | ogdf::GraphCopy | private |
| initWGC(const EdgeWeightedGraphCopy &wGC, NodeArray< node > &vCopy, EdgeArray< edge > &eCopy) | ogdf::EdgeWeightedGraphCopy< T > | private |
| insert(const Graph &G, NodeArray< node > &nodeMap) | ogdf::Graph | |
| insert(const Graph &G) | ogdf::Graph | |
| insertCrossing(edge &crossingEdge, edge crossedEdge, bool rightToLeft) | ogdf::GraphCopy | |
| insertEdgePath(edge eOrig, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| insertEdgePath(node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| isDummy(node v) const | ogdf::GraphCopy | inline |
| isDummy(edge e) const | ogdf::GraphCopy | inline |
| isReversed(edge e) const | ogdf::GraphCopy | inline |
| isReversedCopyEdge(edge e) const | ogdf::GraphCopy | |
| lastEdge() const | ogdf::Graph | inline |
| lastNode() const | ogdf::Graph | inline |
| m_eCopy | ogdf::GraphCopy | protected |
| m_edgeArrayTableSize | ogdf::Graph | private |
| m_edgeIdCount | ogdf::Graph | private |
| m_edgeWeight | ogdf::EdgeWeightedGraphCopy< T > | protected |
| m_eIterator | ogdf::GraphCopy | protected |
| m_eOrig | ogdf::GraphCopy | protected |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_mutexRegArrays | ogdf::Graph | mutableprivate |
| m_nodeArrayTableSize | ogdf::Graph | private |
| m_nodeIdCount | ogdf::Graph | private |
| m_pGraph | ogdf::GraphCopy | protected |
| m_regAdjArrays | ogdf::Graph | mutableprivate |
| m_regEdgeArrays | ogdf::Graph | mutableprivate |
| m_regNodeArrays | ogdf::Graph | mutableprivate |
| m_regStructures | ogdf::Graph | mutableprivate |
| m_vCopy | ogdf::GraphCopy | protected |
| m_vOrig | ogdf::GraphCopy | protected |
| 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 u, node v, T weight) | ogdf::EdgeWeightedGraphCopy< T > | |
| newEdge(edge eOrig, T weight) | ogdf::EdgeWeightedGraphCopy< T > | |
| ogdf::GraphCopy::newEdge(edge eOrig) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(node v, node w) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(node v, node w, int index) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(node v, adjEntry adjTgt) | ogdf::GraphCopy | |
| ogdf::GraphCopy::newEdge(adjEntry adjSrc, node w) | ogdf::GraphCopy | |
| newNode(node vOrig) | ogdf::GraphCopy | inline |
| newNode() | ogdf::GraphCopy | |
| newNode(int index) | ogdf::GraphCopy | |
| node_iterator typedef | ogdf::Graph | |
| nodeArrayTableSize() const | ogdf::Graph | inline |
| nodes | ogdf::Graph | |
| NodeType enum name | ogdf::Graph | |
| numberOfEdges() const | ogdf::Graph | inline |
| numberOfNodes() const | ogdf::Graph | inline |
| operator=(const EdgeWeightedGraphCopy &wGC) | ogdf::EdgeWeightedGraphCopy< T > | |
| ogdf::GraphCopy::operator=(const GraphCopy &GC) | ogdf::GraphCopy | |
| ogdf::Graph::operator=(const Graph &G) | ogdf::Graph | |
| original() const | ogdf::GraphCopy | inline |
| original(node v) const | ogdf::GraphCopy | inline |
| original(edge e) const | ogdf::GraphCopy | inline |
| original(adjEntry adj) const | ogdf::GraphCopy | inline |
| 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 |
| removeAdjacentEdgesCrossing(adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
| removeEdgePath(edge eOrig) | ogdf::GraphCopy | |
| removeEdgePathEmbedded(CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces) | ogdf::GraphCopy | |
| removeEdgePathEmbedded(CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig) | ogdf::GraphCopy | |
| removeNonSimpleCrossings(SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | |
| removeNonSimpleCrossings(DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | inline |
| removeNonSimpleCrossings(node origNode, DynamicDualGraph *dualGraph=nullptr) | ogdf::GraphCopy | inline |
| removePseudoCrossings() | ogdf::GraphCopy | |
| removeSameEdgesCrossing(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
| removeUnnecessaryCrossing(adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2) | ogdf::GraphCopy | protected |
| removeUnnecessaryCrossing(adjEntry adj, DynamicDualGraph *dualGraph) | ogdf::GraphCopy | protected |
| representsCombEmbedding() const | ogdf::Graph | inline |
| resetAdjEntryIndex(int newIndex, int oldIndex) | ogdf::Graph | private |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resetTableSizes() | ogdf::Graph | private |
| 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 | |
| setEdge(edge eOrig, edge eCopy) | ogdf::GraphCopy | |
| setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2) | ogdf::GraphCopy | protected |
| setOriginalEmbedding() | ogdf::GraphCopy | |
| setWeight(const edge e, T v) | ogdf::EdgeWeightedGraphCopy< T > | inline |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
| split(edge e) override | ogdf::GraphCopy | virtual |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
| swapOriginalEdgesAtCrossing(adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr) | ogdf::GraphCopy | protected |
| swapOriginalEdgesBetweenCrossings(adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr) | ogdf::GraphCopy | protected |
| 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::GraphCopy | virtual |
| ogdf::Graph::unsplit(node u) | ogdf::Graph | |
| weight(const edge e) const | ogdf::EdgeWeightedGraphCopy< T > | inline |
| ~EdgeWeightedGraphCopy() | ogdf::EdgeWeightedGraphCopy< T > | inlinevirtual |
| ~Graph() | ogdf::Graph | virtual |
| ~GraphCopy() | ogdf::GraphCopy | inlinevirtual |
