| addEdge(node u, node v, bool addAlways=false) | ogdf::ExtendedNestingGraph | protected |
| adjEdges(node v, EDGELIST &edges) const | ogdf::Graph | inline |
| adjEntries(node v, ADJLIST &entries) const | ogdf::Graph | inline |
| adjEntryArrayTableSize() const | ogdf::Graph | inline |
| aeLevel(node v) const | ogdf::ExtendedNestingGraph | inline |
| allEdges(EDGELIST &edges) const | ogdf::Graph | inline |
| allNodes(NODELIST &nodes) const | ogdf::Graph | inline |
| assign(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| assignAeLevel(cluster c, int &count) | ogdf::ExtendedNestingGraph | protected |
| assignPos(const LHTreeNode *vNode, int &count) | ogdf::ExtendedNestingGraph | protected |
| association enum value | ogdf::Graph | |
| associationClass enum value | ogdf::Graph | |
| 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() const | ogdf::Graph | |
| chooseNode() const | ogdf::Graph | |
| clear() | ogdf::Graph | |
| collaps(NODELIST &nodes) | ogdf::Graph | inline |
| computeRanking() | ogdf::ExtendedNestingGraph | private |
| consistencyCheck() const | ogdf::Graph | |
| construct(const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByActiveNodes(const List< node > &nodes, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| constructInitByNodes(const Graph &G, const List< node > &nodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge) | ogdf::Graph | protected |
| contract(edge e) | 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 | |
| delNode(node v) | ogdf::Graph | |
| dependency enum value | ogdf::Graph | |
| dummy enum value | ogdf::Graph | |
| edgeArrayTableSize() const | ogdf::Graph | inline |
| EdgeType enum name | ogdf::Graph | |
| empty() const | ogdf::Graph | inline |
| ExtendedNestingGraph(const ClusterGraph &CG) | ogdf::ExtendedNestingGraph | |
| firstEdge() const | ogdf::Graph | inline |
| firstNode() const | ogdf::Graph | inline |
| generalization enum value | ogdf::Graph | |
| generalizationExpander enum value | ogdf::Graph | |
| generalizationMerger enum value | ogdf::Graph | |
| genus() const | ogdf::Graph | |
| getClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
| getOriginalClusterGraph() const | ogdf::ExtendedNestingGraph | inline |
| Graph() | ogdf::Graph | |
| Graph(const Graph &G) | ogdf::Graph | |
| hideEdge(edge e) | ogdf::Graph | |
| highDegreeExpander enum value | ogdf::Graph | |
| inEdges(node v, EDGELIST &edges) const | ogdf::Graph | inline |
| 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 |
| lowDegreeExpander enum value | ogdf::Graph | |
| 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_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_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_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 |
| 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) | ogdf::Graph | |
| newEdge(node v, node w, int index) | ogdf::Graph | |
| newEdge(adjEntry adjSrc, adjEntry adjTgt, Direction dir=ogdf::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 | |
| nextPower2(int start, int idCount) | ogdf::Graph | static |
| nodeArrayTableSize() const | ogdf::Graph | inline |
| NodeType enum name | ogdf::ExtendedNestingGraph | |
| ntClusterBottom enum value | ogdf::ExtendedNestingGraph | |
| ntClusterTop enum value | ogdf::ExtendedNestingGraph | |
| ntClusterTopBottom enum value | ogdf::ExtendedNestingGraph | |
| ntDummy enum value | ogdf::ExtendedNestingGraph | |
| ntNode enum value | ogdf::ExtendedNestingGraph | |
| numberOfEdges() const | ogdf::Graph | inline |
| numberOfLayers() const | ogdf::ExtendedNestingGraph | inline |
| numberOfNodes() const | ogdf::Graph | inline |
| operator=(const Graph &G) | ogdf::Graph | |
| origEdge(edge e) const | ogdf::ExtendedNestingGraph | inline |
| originalCluster(node v) const | ogdf::ExtendedNestingGraph | inline |
| origNode(node v) const | ogdf::ExtendedNestingGraph | inline |
| outEdges(node v, EDGELIST &edges) const | ogdf::Graph | 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 |
| rank(node v) const | ogdf::ExtendedNestingGraph | inline |
| reachable(node v, node u, SListPure< node > &successors) | ogdf::ExtendedNestingGraph | protected |
| readGML(const char *fileName) | ogdf::Graph | |
| readGML(istream &is) | ogdf::Graph | |
| readLEDAGraph(const char *fileName) | ogdf::Graph | |
| readLEDAGraph(istream &is) | ogdf::Graph | |
| reduceCrossings(int i, bool dirTopDown) | ogdf::ExtendedNestingGraph | |
| reduceCrossings(LHTreeNode *cNode, bool dirTopDown) | ogdf::ExtendedNestingGraph | protected |
| registerArray(NodeArrayBase *pNodeArray) const | ogdf::Graph | |
| registerArray(EdgeArrayBase *pEdgeArray) const | ogdf::Graph | |
| registerArray(AdjEntryArrayBase *pAdjArray) const | ogdf::Graph | |
| registerStructure(GraphObserver *pStructure) const | ogdf::Graph | |
| removeAuxNodes() | ogdf::ExtendedNestingGraph | private |
| removeTopBottomEdges() | ogdf::ExtendedNestingGraph | |
| representsCombEmbedding() const | ogdf::Graph | inline |
| resetEdgeIdCount(int maxId) | ogdf::Graph | |
| restoreAllEdges() | ogdf::Graph | |
| restoreEdge(edge e) | 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) const | ogdf::Graph | |
| sort(node v, const ADJ_ENTRY_LIST &newOrder) | 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 |
| 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(node u) | ogdf::Graph | |
| unsplit(edge eIn, edge eOut) | ogdf::Graph | virtual |
| vertex enum value | ogdf::Graph | |
| verticalSegment(edge e) const | ogdf::ExtendedNestingGraph | inline |
| writeGML(const char *fileName) const | ogdf::Graph | |
| writeGML(ostream &os) const | ogdf::Graph | |
| ~Graph() | ogdf::Graph | virtual |
