| addEdge(node u, node v, bool addAlways=false) | ogdf::ExtendedNestingGraph | protected |
| adjEntry_iterator typedef | ogdf::Graph | |
| adjEntryRegistry() | ogdf::Graph | inline |
| adjEntryRegistry() const | ogdf::Graph | inline |
| aeLevel(node v) const | ogdf::ExtendedNestingGraph | inline |
| allEdges(CONTAINER &edgeContainer) const | ogdf::Graph | inline |
| allNodes(CONTAINER &nodeContainer) const | ogdf::Graph | inline |
| assignAeLevel(cluster c, int &count) | ogdf::ExtendedNestingGraph | protected |
| assignPos(const LHTreeNode *vNode, int &count) | ogdf::ExtendedNestingGraph | protected |
| bottom(cluster cOrig) const | ogdf::ExtendedNestingGraph | inline |
| bottomRank(cluster c) const | ogdf::ExtendedNestingGraph | inline |
| buildLayers() | ogdf::ExtendedNestingGraph | private |
| chain(edge e) const | ogdf::ExtendedNestingGraph | 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 |
| clearObservers() | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
| collapse(NODELIST &nodesToCollapse) | ogdf::Graph | inline |
| computeRanking() | ogdf::ExtendedNestingGraph | private |
| consistencyCheck() const | ogdf::Graph | |
| contract(edge e, bool keepSelfLoops=false) | ogdf::Graph | |
| copy(node v) const | ogdf::ExtendedNestingGraph | inline |
| createDummyNodes() | ogdf::ExtendedNestingGraph | private |
| createVirtualClusters() | ogdf::ExtendedNestingGraph | private |
| createVirtualClusters(cluster c, NodeArray< node > &vCopy, ClusterArray< node > &cCopy) | ogdf::ExtendedNestingGraph | private |
| delEdge(edge e) | ogdf::Graph | virtual |
| delNode(node v) | ogdf::Graph | virtual |
| edge_iterator typedef | ogdf::Graph | |
| edgeInserted(void *userData, edge original, edge copy) | ogdf::Graph | inlineprotectedvirtual |
| edgeRegistry() | ogdf::Graph | inline |
| edgeRegistry() const | ogdf::Graph | inline |
| edges | ogdf::Graph | |
| EdgeType enum name | ogdf::Graph | |
| empty() const | ogdf::Graph | inline |
| ExtendedNestingGraph(const ClusterGraph &CG) | ogdf::ExtendedNestingGraph | explicit |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| genus() const | ogdf::Graph | |
| getClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
| getObservers() const | ogdf::Observable< GraphObserver, Graph > | inlineprotected |
| getOriginalClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
| Graph() | ogdf::Graph | |
| Graph(const Graph ©) | ogdf::Graph | |
| Graph(Graph &&move)=delete | ogdf::Graph | |
| 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 |
| insertNodes(const NI &nodesBegin, const NI &nodesEnd, NodeArray< node, true > &nodeMap, int &newNodes, void *cbData) | ogdf::Graph | private |
| isLongEdgeDummy(node v) const | ogdf::ExtendedNestingGraph | inline |
| isReversed(edge e) const | ogdf::ExtendedNestingGraph | inline |
| isVirtual(cluster c) const | ogdf::ExtendedNestingGraph | inline |
| lastEdge() const | ogdf::Graph | inline |
| lastNode() const | ogdf::Graph | inline |
| layer(int i) const | ogdf::ExtendedNestingGraph | inline |
| layerHierarchyTree(int i) const | ogdf::ExtendedNestingGraph | inline |
| lca(node u, node v) const | ogdf::ExtendedNestingGraph | protected |
| lca(LHTreeNode *uNode, LHTreeNode *vNode, LHTreeNode **uChild, LHTreeNode **vChild) const | ogdf::ExtendedNestingGraph | protected |
| m_aeLevel | ogdf::ExtendedNestingGraph | private |
| m_aeVisited | ogdf::ExtendedNestingGraph | private |
| m_auxDeg | ogdf::ExtendedNestingGraph | private |
| m_bottomNode | ogdf::ExtendedNestingGraph | private |
| m_bottomRank | ogdf::ExtendedNestingGraph | private |
| m_CGC | ogdf::ExtendedNestingGraph | private |
| m_copy | ogdf::ExtendedNestingGraph | private |
| m_copyEdge | ogdf::ExtendedNestingGraph | private |
| m_edgeIdCount | ogdf::Graph | private |
| m_hiddenEdgeSets | ogdf::Graph | private |
| m_layer | ogdf::ExtendedNestingGraph | private |
| m_mark | ogdf::ExtendedNestingGraph | mutableprivate |
| m_markedClusters | ogdf::ExtendedNestingGraph | mutableprivate |
| m_markedClustersTree | ogdf::ExtendedNestingGraph | mutableprivate |
| m_markTree | ogdf::ExtendedNestingGraph | mutableprivate |
| m_mutexRegArrays | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
| m_nodeIdCount | ogdf::Graph | private |
| m_numLayers | ogdf::ExtendedNestingGraph | private |
| m_origEdge | ogdf::ExtendedNestingGraph | private |
| m_origNode | ogdf::ExtendedNestingGraph | private |
| m_pos | ogdf::ExtendedNestingGraph | private |
| m_rank | ogdf::ExtendedNestingGraph | private |
| m_regAdjArrays | ogdf::Graph | private |
| m_regEdgeArrays | ogdf::Graph | private |
| m_regNodeArrays | ogdf::Graph | private |
| m_regObservers | ogdf::Observable< GraphObserver, Graph > | mutableprivate |
| m_secondPath | ogdf::ExtendedNestingGraph | mutableprivate |
| m_secondPathTo | ogdf::ExtendedNestingGraph | mutableprivate |
| m_topNode | ogdf::ExtendedNestingGraph | private |
| m_topRank | ogdf::ExtendedNestingGraph | private |
| m_type | ogdf::ExtendedNestingGraph | private |
| m_vertical | ogdf::ExtendedNestingGraph | 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 |
| moveDown(node v, const SListPure< node > &successors, NodeArray< int > &level) | ogdf::ExtendedNestingGraph | protected |
| 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, int index=-1) | ogdf::Graph | inline |
| newEdge(node v, adjEntry adjTgt, int index=-1) | ogdf::Graph | inline |
| newEdge(adjEntry adjSrc, node w, int index=-1) | ogdf::Graph | inline |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1) | ogdf::Graph | inline |
| newEdge(S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1) | ogdf::Graph | inline |
| newNode(int index=-1) | ogdf::Graph | inline |
| node_iterator typedef | ogdf::Graph | |
| nodeInserted(void *userData, node original, node copy) | ogdf::Graph | inlineprotectedvirtual |
| nodeRegistry() | ogdf::Graph | inline |
| nodeRegistry() const | ogdf::Graph | inline |
| nodes | ogdf::Graph | |
| NodeType enum name | ogdf::ExtendedNestingGraph | |
| numberOfEdges() const | ogdf::Graph | inline |
| numberOfLayers() const | ogdf::ExtendedNestingGraph | 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 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 > | |
| origEdge(edge e) const | ogdf::ExtendedNestingGraph | inline |
| originalCluster(node v) const | ogdf::ExtendedNestingGraph | inline |
| origNode(node v) const | ogdf::ExtendedNestingGraph | inline |
| parent(node v) const | ogdf::ExtendedNestingGraph | inline |
| parent(cluster c) const | ogdf::ExtendedNestingGraph | inline |
| permute() | ogdf::ExtendedNestingGraph | |
| pos(node v) const | ogdf::ExtendedNestingGraph | 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) | ogdf::Graph | inlineprotectedvirtual |
| pureNewEdge(node src, node tgt, int index) | ogdf::Graph | inlineprivate |
| pureNewNode(int index) | ogdf::Graph | inlineprivate |
| rank(node v) const | ogdf::ExtendedNestingGraph | inline |
| reachable(node v, node u, SListPure< node > &successors) | ogdf::ExtendedNestingGraph | protected |
| reduceCrossings(int i, bool dirTopDown) | ogdf::ExtendedNestingGraph | |
| reduceCrossings(LHTreeNode *cNode, bool dirTopDown) | ogdf::ExtendedNestingGraph | protected |
| registerObserver(GraphObserver *obs) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
| removeAuxNodes() | ogdf::ExtendedNestingGraph | private |
| removeTopBottomEdges() | ogdf::ExtendedNestingGraph | |
| representsCombEmbedding() const | ogdf::Graph | inline |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| resetNodeIdCount(int maxId) | ogdf::Graph | |
| restoreAllEdges() | ogdf::Graph | |
| restorePos() | ogdf::ExtendedNestingGraph | |
| 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 | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | ogdf::Graph | inline |
| sort(node v, IT begin, IT end) | ogdf::Graph | inline |
| split(edge e) | ogdf::Graph | virtual |
| splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) | ogdf::Graph | |
| storeCurrentPos() | ogdf::ExtendedNestingGraph | |
| swapAdjEdges(adjEntry adj1, adjEntry adj2) | ogdf::Graph | inline |
| top(cluster cOrig) const | ogdf::ExtendedNestingGraph | inline |
| topRank(cluster c) const | ogdf::ExtendedNestingGraph | inline |
| tryEdge(node u, node v, Graph &G, NodeArray< int > &level) | ogdf::ExtendedNestingGraph | protected |
| type(node v) const | ogdf::ExtendedNestingGraph | inline |
| unregisterObserver(typename ListPure< GraphObserver * >::iterator it) const | ogdf::Observable< GraphObserver, Graph > | inlineprivate |
| unsplit(node u) | ogdf::Graph | |
| unsplit(edge eIn, edge eOut) | ogdf::Graph | virtual |
| verticalSegment(edge e) const | ogdf::ExtendedNestingGraph | inline |
| ~Graph() | ogdf::Graph | virtual |
| ~Observable() | ogdf::Observable< GraphObserver, Graph > | inlinevirtual |
