| adjAvailable(bool val) | ogdf::ClusterGraph | inline |
| adjEdges(cluster c, EDGELIST &edges) const | ogdf::ClusterGraph | inline |
| adjEntries(cluster c, ADJLIST &entries) const | ogdf::ClusterGraph | inline |
| allClusters(CLUSTERLIST &clusterList) const | ogdf::ClusterGraph | inline |
| assignNode(node v, cluster C) | ogdf::ClusterGraph | private |
| clear() | ogdf::ClusterGraph | |
| clearClusterTree(cluster C) | ogdf::ClusterGraph | |
| clearClusterTree(cluster c, List< node > &attached) | ogdf::ClusterGraph | private |
| cleared() override | ogdf::ClusterGraph | inlineprotectedvirtual |
| cluster_iterator typedef | ogdf::ClusterGraph | |
| clusterArrayTableSize() const | ogdf::ClusterGraph | inline |
| clusterDepth(cluster c) const | ogdf::ClusterGraph | inline |
| ClusterGraph() | ogdf::ClusterGraph | |
| ClusterGraph(const Graph &G) | ogdf::ClusterGraph | |
| ClusterGraph(const ClusterGraph &C) | ogdf::ClusterGraph | |
| ClusterGraph(const ClusterGraph &C, Graph &G) | ogdf::ClusterGraph | |
| ClusterGraph(const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable) | ogdf::ClusterGraph | |
| ClusterGraph(const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable, EdgeArray< edge > &edgeCopy) | ogdf::ClusterGraph | |
| clusterOf(node v) const | ogdf::ClusterGraph | inline |
| clusters | ogdf::ClusterGraph | |
| collapse(NODELIST &nodes, Graph &G) | ogdf::ClusterGraph | inline |
| commonCluster(SList< node > &nodes) | ogdf::ClusterGraph | |
| commonCluster(node v, node w) const | ogdf::ClusterGraph | inline |
| commonClusterAncestorsPath(node v, node w, cluster &c1, cluster &c2, List< cluster > &eL) const | ogdf::ClusterGraph | |
| commonClusterLastAncestors(node v, node w, cluster &c1, cluster &c2) const | ogdf::ClusterGraph | inline |
| commonClusterPath(node v, node w, List< cluster > &eL) const | ogdf::ClusterGraph | inline |
| computeSubTreeDepth(cluster c) const | ogdf::ClusterGraph | |
| constGraph() const | ogdf::ClusterGraph | inline |
| constructClusterTree(const ClusterGraph &C, const Graph &G, ClusterArray< cluster > &originalClusterTable, std::function< node(node)> nodeMap=[](node v) { return v;}) | ogdf::ClusterGraph | private |
| copyLCA(const ClusterGraph &C) | ogdf::ClusterGraph | protected |
| createCluster(SList< node > &nodes, const cluster parent=nullptr) | ogdf::ClusterGraph | |
| createEmptyCluster(const cluster parent=nullptr, int clusterId=-1) | ogdf::ClusterGraph | |
| deepCopy(const ClusterGraph &C, Graph &G) | ogdf::ClusterGraph | private |
| deepCopy(const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable) | ogdf::ClusterGraph | private |
| deepCopy(const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable, EdgeArray< edge > &edgeCopy) | ogdf::ClusterGraph | private |
| delCluster(cluster c) | ogdf::ClusterGraph | |
| doClear() | ogdf::ClusterGraph | protected |
| doCreateCluster(SList< node > &nodes, const cluster parent, int clusterId=-1) | ogdf::ClusterGraph | protected |
| doCreateCluster(SList< node > &nodes, SList< cluster > &emptyCluster, const cluster parent, int clusterId=-1) | ogdf::ClusterGraph | protected |
| edgeAdded(edge) override | ogdf::ClusterGraph | inlineprotectedvirtual |
| edgeDeleted(edge) override | ogdf::ClusterGraph | inlineprotectedvirtual |
| emptyClusters(SList< cluster > &emptyCluster, SList< cluster > *checkCluster=nullptr) | ogdf::ClusterGraph | |
| emptyOnClusterDelete(cluster c) | ogdf::ClusterGraph | inline |
| emptyOnNodeDelete(cluster c) | ogdf::ClusterGraph | inline |
| fillEmptyClusters(SList< cluster > &emptyCluster, const T &clusterList) const | ogdf::ClusterGraph | inlineprivate |
| firstCluster() const | ogdf::ClusterGraph | inline |
| firstPostOrderCluster() const | ogdf::ClusterGraph | inline |
| getGraph() const | ogdf::GraphObserver | inline |
| GraphObserver() | ogdf::GraphObserver | inline |
| GraphObserver(const Graph *G) | ogdf::GraphObserver | inlineexplicit |
| init(const Graph &G) | ogdf::ClusterGraph | |
| initGraph(const Graph &G) | ogdf::ClusterGraph | private |
| lastCluster() const | ogdf::ClusterGraph | inline |
| leftMostCluster(cluster c) const | ogdf::ClusterGraph | protected |
| m_adjAvailable | ogdf::ClusterGraph | private |
| m_allowEmptyClusters | ogdf::ClusterGraph | private |
| m_clusterArrayTableSize | ogdf::ClusterGraph | private |
| m_clusterIdCount | ogdf::ClusterGraph | private |
| m_depthUpToDate | ogdf::ClusterGraph | mutableprotected |
| m_itGList | ogdf::GraphObserver | protected |
| m_itMap | ogdf::ClusterGraph | private |
| m_lcaNumber | ogdf::ClusterGraph | mutableprotected |
| m_lcaSearch | ogdf::ClusterGraph | mutableprotected |
| m_mutexRegArrays | ogdf::ClusterGraph | mutableprivate |
| m_nodeMap | ogdf::ClusterGraph | private |
| m_pGraph | ogdf::ClusterGraph | private |
| m_postOrderStart | ogdf::ClusterGraph | mutableprivate |
| m_regClusterArrays | ogdf::ClusterGraph | mutableprivate |
| m_regObservers | ogdf::ClusterGraph | mutableprivate |
| m_rootCluster | ogdf::ClusterGraph | private |
| m_updateDepth | ogdf::ClusterGraph | mutableprotected |
| m_vAncestor | ogdf::ClusterGraph | mutableprotected |
| m_wAncestor | ogdf::ClusterGraph | mutableprotected |
| makeAdjEntries(cluster c, LISTITERATOR start) | ogdf::ClusterGraph | inline |
| maxClusterIndex() const | ogdf::ClusterGraph | inline |
| moveCluster(cluster c, cluster newParent) | ogdf::ClusterGraph | |
| moveRegisterArray(ListIterator< ClusterArrayBase * > it, ClusterArrayBase *pClusterArray) const | ogdf::ClusterGraph | |
| newCluster(cluster parent, int id=-1) | ogdf::ClusterGraph | |
| newCluster(int id) | ogdf::ClusterGraph | private |
| newCluster() | ogdf::ClusterGraph | private |
| nodeAdded(node v) override | ogdf::ClusterGraph | inlineprotectedvirtual |
| nodeDeleted(node v) override | ogdf::ClusterGraph | protectedvirtual |
| numberOfClusters() const | ogdf::ClusterGraph | inline |
| operator const Graph &() const | ogdf::ClusterGraph | inline |
| operator=(const ClusterGraph &C) | ogdf::ClusterGraph | |
| postOrder() const | ogdf::ClusterGraph | private |
| postOrder(cluster c, SListPure< cluster > &S) const | ogdf::ClusterGraph | private |
| postOrderPredecessor(cluster c) const | ogdf::ClusterGraph | protected |
| pullUpSubTree(cluster c) | ogdf::ClusterGraph | |
| reassignNode(node v, cluster c) | ogdf::ClusterGraph | |
| recurseClearClusterTreeOnChildren(cluster c, List< node > &attached) | ogdf::ClusterGraph | inlineprivate |
| registerArray(ClusterArrayBase *pClusterArray) const | ogdf::ClusterGraph | |
| registerObserver(ClusterGraphObserver *pObserver) const | ogdf::ClusterGraph | |
| reInit(Graph &G) | ogdf::ClusterGraph | inline |
| reinitArrays() | ogdf::ClusterGraph | private |
| reinitGraph(const Graph &G) | ogdf::ClusterGraph | private |
| removeNodeAssignment(node v) | ogdf::ClusterGraph | inlineprivate |
| representsCombEmbedding() const | ogdf::ClusterGraph | |
| reregister(const Graph *pG) | ogdf::GraphObserver | inline |
| rootCluster() const | ogdf::ClusterGraph | inline |
| setUpdateDepth(bool b) const | ogdf::ClusterGraph | inline |
| shallowCopy(const ClusterGraph &C) | ogdf::ClusterGraph | private |
| treeDepth() const | ogdf::ClusterGraph | |
| unassignNode(node v) | ogdf::ClusterGraph | private |
| unregisterArray(ListIterator< ClusterArrayBase * > it) const | ogdf::ClusterGraph | |
| unregisterObserver(ListIterator< ClusterGraphObserver * > it) const | ogdf::ClusterGraph | |
| updatePostOrder(cluster c, cluster oldParent, cluster newParent) | ogdf::ClusterGraph | protected |
| ~ClusterGraph() | ogdf::ClusterGraph | virtual |
| ~GraphObserver() | ogdf::GraphObserver | inlinevirtual |
