| adjEntry_iterator typedef | ogdf::Graph | |
| adjEntryRegistry() | ogdf::Graph | inline |
| adjEntryRegistry() const | ogdf::Graph | inline |
| allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
| allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
| augment() | ogdf::UpwardPlanRep | |
| augmented() const | ogdf::UpwardPlanRep | inline |
| 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 |
| clearObservers() | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
| computeSinkSwitches() | ogdf::UpwardPlanRep | private |
| consistencyCheck() const | ogdf::GraphCopy | |
| constructSinkArcs(face f, node t) | ogdf::UpwardPlanRep | private |
| contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
| copy(edge e) const override | ogdf::GraphCopy | inlinevirtual |
| copy(adjEntry adj) const override | ogdf::GraphCopy | inlinevirtual |
| copy(node v) const | ogdf::GraphCopy | inline |
| copy(edge e) const=0 | ogdf::GraphCopy | |
| copy(adjEntry adj) const=0 | ogdf::GraphCopy | |
| ogdf::GraphCopyBase::copy(node v) const | ogdf::GraphCopyBase | inline |
| copyMe(const UpwardPlanRep &UPR) | ogdf::UpwardPlanRep | private |
| createEmpty(const Graph &G) | ogdf::GraphCopyBase | inline |
| crossings | ogdf::UpwardPlanRep | protected |
| delEdge(edge e) override | ogdf::GraphCopy | virtual |
| delNode(node v) override | ogdf::GraphCopyBase | inlinevirtual |
| edge_iterator typedef | ogdf::Graph | |
| edgeInserted(void *userData, edge original, edge copy) override | ogdf::GraphCopy | protectedvirtual |
| edgeRegistry() | ogdf::Graph | inline |
| edgeRegistry() const | ogdf::Graph | inline |
| edges | ogdf::Graph | |
| EdgeType enum name | ogdf::Graph | |
| empty() const | ogdf::Graph | inline |
| extFaceHandle | ogdf::UpwardPlanRep | protected |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| genus() const | ogdf::Graph | |
| getAdjEntry(const CombinatorialEmbedding &Gamma, node v, face f) const | ogdf::UpwardPlanRep | |
| getEmbedding() const | ogdf::UpwardPlanRep | inline |
| getEmbedding() | ogdf::UpwardPlanRep | inline |
| getLinkCopiesOnInsert() const | ogdf::GraphCopyBase | inline |
| getObservers() const | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
| getOriginalGraph() const | ogdf::GraphCopyBase | inline |
| getSuperSink() const | ogdf::UpwardPlanRep | inline |
| getSuperSource() const | ogdf::UpwardPlanRep | inline |
| Graph() | ogdf::Graph | |
| Graph(const Graph ©) | ogdf::Graph | |
| Graph(Graph &&move)=delete | ogdf::Graph | |
| GraphCopy() | ogdf::GraphCopy | inlineexplicit |
| GraphCopy(const Graph &G) | ogdf::GraphCopy | inlineexplicit |
| GraphCopy(const Graph *G) | ogdf::GraphCopy | inlineexplicit |
| GraphCopy(const GraphCopy &other) | ogdf::GraphCopy | inline |
| GraphCopyBase()=default | ogdf::GraphCopyBase | |
| GraphCopyBase(const GraphCopyBase &other)=delete | ogdf::GraphCopyBase | |
| GraphCopyBase(GraphCopyBase &&other) noexcept=delete | ogdf::GraphCopyBase | |
| hasAdjacentEdgesCrossings() const | ogdf::GraphCopy | |
| hasNonSimpleCrossings() const | ogdf::GraphCopy | inline |
| hasSameEdgesCrossings() const | ogdf::GraphCopy | |
| init(const Graph &G) | ogdf::GraphCopyBase | inline |
| init(const Graph *G) | ogdf::GraphCopyBase | inline |
| initMe() | ogdf::UpwardPlanRep | private |
| insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
| insert(const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
| insert(const NL &nodeList, const EdgeSet< true > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
| insert(const NL &nodeList, const EdgeSet< false > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | |
| insert(const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
| insert(const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
| insert(const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap) | ogdf::Graph | inline |
| insert(const Graph &G) | ogdf::Graph | inline |
| insertAdjEntry(adjEntry oldAdj, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
| insertAdjEntry(node n, adjEntry newAdj, Direction dir) | ogdf::Graph | inlineprivatestatic |
| 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, SList< adjEntry > crossedEdges, EdgeArray< int > &cost) | ogdf::UpwardPlanRep | |
| ogdf::GraphCopy::insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| ogdf::GraphCopy::insertEdgePathEmbedded(edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges) | ogdf::GraphCopy | |
| insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData) | ogdf::Graph | private |
| isAugmented | ogdf::UpwardPlanRep | protected |
| isDummy(node v) const | ogdf::GraphCopyBase | inline |
| isDummy(edge e) const | ogdf::GraphCopyBase | inline |
| isDummy(adjEntry adj) const | ogdf::GraphCopyBase | inline |
| isReversed(edge e) const | ogdf::GraphCopy | inline |
| isReversedCopyEdge(edge e) const | ogdf::GraphCopy | |
| isSinkArc(edge e) const | ogdf::UpwardPlanRep | inline |
| isSourceArc(edge e) const | ogdf::UpwardPlanRep | inline |
| lastEdge() const | ogdf::Graph | inline |
| lastNode() const | ogdf::Graph | inline |
| leftInEdge(node v) const | ogdf::UpwardPlanRep | inline |
| m_eCopy | ogdf::GraphCopy | protected |
| m_edgeIdCount | ogdf::Graph | private |
| m_eIterator | ogdf::GraphCopy | protected |
| m_eOrig | ogdf::GraphCopyBase | protected |
| m_Gamma | ogdf::UpwardPlanRep | protected |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_isSinkArc | ogdf::UpwardPlanRep | protected |
| m_isSourceArc | ogdf::UpwardPlanRep | protected |
| m_linkCopiesOnInsert | ogdf::GraphCopyBase | protected |
| m_mutexRegArrays | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
| m_nodeIdCount | ogdf::Graph | private |
| m_pGraph | ogdf::GraphCopyBase | protected |
| m_regAdjArrays | ogdf::Graph | private |
| m_regEdgeArrays | ogdf::Graph | private |
| m_regNodeArrays | ogdf::Graph | private |
| m_regObservers | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
| m_sinkSwitchOf | ogdf::UpwardPlanRep | protected |
| m_vCopy | ogdf::GraphCopyBase | protected |
| m_vOrig | ogdf::GraphCopyBase | 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 |
| 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(edge eOrig) | ogdf::GraphCopy | |
| newEdge(node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E) | ogdf::GraphCopy | |
| newEdge(node v, node w, int index=-1) | ogdf::GraphCopy | inline |
| newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::GraphCopy | inline |
| newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::GraphCopy | inline |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::GraphCopy | inline |
| newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::GraphCopy | inline |
| ogdf::GraphCopyBase::newEdge(node v, node w, int index=-1) | ogdf::Graph | inline |
| ogdf::GraphCopyBase::newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::Graph | inline |
| ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::Graph | inline |
| ogdf::GraphCopyBase::newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::Graph | inline |
| ogdf::GraphCopyBase::newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::Graph | inline |
| newNode(node vOrig) | ogdf::GraphCopyBase | inline |
| newNode(int index=-1) | ogdf::GraphCopyBase | inline |
| ogdf::Graph::newNode(int index=-1) | ogdf::Graph | inline |
| node_iterator typedef | ogdf::Graph | |
| nodeInserted(void *userData, node original, node copy) override | ogdf::GraphCopyBase | protectedvirtual |
| nodeRegistry() | ogdf::Graph | inline |
| nodeRegistry() const | ogdf::Graph | inline |
| nodes | ogdf::Graph | |
| NodeType enum name | ogdf::Graph | |
| numberOfCrossings() const | ogdf::UpwardPlanRep | inline |
| numberOfEdges() const | ogdf::Graph | inline |
| numberOfNodes() const | ogdf::Graph | inline |
| Observable()=default | ogdf::Observable< GraphObserver, Graph > | |
| Observable(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
| Observable(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
| Observer< TObserved, TObserver > | ogdf::Observable< GraphObserver, Graph > | private |
| operator const internal::GraphAdjRegistry &() const | ogdf::Graph | inline |
| operator const internal::GraphEdgeRegistry &() const | ogdf::Graph | inline |
| operator const internal::GraphNodeRegistry &() const | ogdf::Graph | inline |
| operator=(const UpwardPlanRep ©) | ogdf::UpwardPlanRep | |
| ogdf::GraphCopy::operator=(const GraphCopy &other) | ogdf::GraphCopy | |
| ogdf::GraphCopyBase::operator=(const GraphCopyBase &other)=delete | ogdf::GraphCopyBase | |
| ogdf::GraphCopyBase::operator=(GraphCopyBase &&other) noexcept=delete | ogdf::GraphCopyBase | |
| ogdf::Graph::operator=(const Graph ©) | ogdf::Graph | |
| ogdf::Graph::operator=(Graph &&move)=delete | ogdf::Graph | |
| Observable< GraphObserver, Graph >::operator=(const Observable ©)=delete | ogdf::Observable< GraphObserver, Graph > | |
| Observable< GraphObserver, Graph >::operator=(Observable &&move)=delete | ogdf::Observable< GraphObserver, Graph > | |
| original() const | ogdf::GraphCopyBase | inline |
| original(node v) const | ogdf::GraphCopyBase | inline |
| original(edge e) const | ogdf::GraphCopyBase | inline |
| original(adjEntry adj) const | ogdf::GraphCopyBase | inline |
| outputFaces(const CombinatorialEmbedding &embedding) const | ogdf::UpwardPlanRep | inline |
| postInsert(void *userData, int newNodes, int newEdges) | ogdf::Graph | inlineprotectedvirtual |
| preInsert(bool copyEmbedding, bool copyIDs, bool notifyObservers, bool edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap, int *newNodes, int *newEdges) override | ogdf::GraphCopyBase | protectedvirtual |
| pureNewEdge(node src, node tgt, int index) | ogdf::Graph | inlineprivate |
| pureNewNode(int index) | ogdf::Graph | inlineprivate |
| registerObserver(GraphObserver *obs) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
| 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 |
| removeSinkArcs(SList< adjEntry > &crossedEdges) | ogdf::UpwardPlanRep | private |
| 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 |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resetNodeIdCount(int maxId) | ogdf::Graph | |
| restoreAllEdges() | ogdf::Graph | |
| reverseAdjEdges(node v) | ogdf::Graph | inline |
| reverseAdjEdges() | ogdf::Graph | |
| reverseAllEdges() | ogdf::Graph | |
| reverseEdge(edge e) | ogdf::Graph | |
| s_hat | ogdf::UpwardPlanRep | protected |
| searchEdge(node v, node w, bool directed=false) const | ogdf::Graph | |
| setEdge(edge eOrig, edge eCopy) | ogdf::GraphCopy | |
| setLinkCopiesOnInsert(bool linkCopiesOnInsert) | ogdf::GraphCopyBase | inline |
| setOriginalEdgeAlongCrossings(adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2) | ogdf::GraphCopy | protected |
| setOriginalEmbedding() override | ogdf::GraphCopy | virtual |
| setOriginalGraph(const Graph *G) override | ogdf::GraphCopy | virtual |
| setOriginalGraph(const Graph *G)=0 | ogdf::GraphCopy | |
| setOriginalGraph(const Graph &G) | ogdf::GraphCopy | inline |
| ogdf::GraphCopyBase::setOriginalGraph(const Graph &G) | ogdf::GraphCopyBase | inline |
| sinkSwitchOf(node v) | ogdf::UpwardPlanRep | inline |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
| sort(node v, IT begin, IT end) | ogdf::Graph | inline |
| split(edge e) override | ogdf::GraphCopy | virtual |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| SubgraphUpwardPlanarizer class | ogdf::UpwardPlanRep | friend |
| 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 |
| t_hat | ogdf::UpwardPlanRep | protected |
| unregisterObserver(typename ListPure< GraphObserver * >::iterator it) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
| unsplit(edge eIn, edge eOut) override | ogdf::GraphCopy | virtual |
| ogdf::GraphCopyBase::unsplit(node u) | ogdf::Graph | |
| UpwardPlanRep(const CombinatorialEmbedding &Gamma) | ogdf::UpwardPlanRep | explicit |
| UpwardPlanRep(const GraphCopy &GC, adjEntry adj_ext) | ogdf::UpwardPlanRep | |
| UpwardPlanRep(const UpwardPlanRep &UPR) | ogdf::UpwardPlanRep | |
| UpwardPlanRep() | ogdf::UpwardPlanRep | inline |
| ~Graph() | ogdf::Graph | virtual |
| ~Observable() | ogdf::Observable< GraphObserver, Graph > | inlinevirtual |
| ~UpwardPlanRep() | ogdf::UpwardPlanRep | inlinevirtual |
