|
| | ClusterGraphCopy () |
| |
| | ClusterGraphCopy (const ExtendedNestingGraph &H, const ClusterGraph &CG) |
| |
| cluster | copy (cluster cOrig) const |
| |
| const ClusterGraph & | getOriginalClusterGraph () const |
| |
| void | init (const ExtendedNestingGraph &H, const ClusterGraph &CG) |
| |
| cluster | original (cluster cCopy) const |
| |
| void | setParent (node v, cluster c) |
| |
| | ClusterGraph () |
| | Creates a cluster graph associated with no graph.
|
| |
| | ClusterGraph (const ClusterGraph &C) |
| | Copy constructor.
|
| |
| | ClusterGraph (const ClusterGraph &C, Graph &G) |
| | Copies the underlying graph of C into G and constructs a copy of C associated with G.
|
| |
| | ClusterGraph (const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable) |
| | Copies the underlying graph of C into G and constructs a copy of C associated with G.
|
| |
| | ClusterGraph (const ClusterGraph &C, Graph &G, ClusterArray< cluster > &originalClusterTable, NodeArray< node > &originalNodeTable, EdgeArray< edge > &edgeCopy) |
| | Copies the underlying graph of C into G and constructs a copy of C associated with G.
|
| |
| | ClusterGraph (const Graph &G) |
| | Creates a cluster graph associated with graph G.
|
| |
| virtual | ~ClusterGraph () |
| | Destructor.
|
| |
| cluster | rootCluster () const |
| | Returns the root cluster.
|
| |
| int | numberOfClusters () const |
| | Returns the number of clusters.
|
| |
| int | maxClusterIndex () const |
| | Returns the maximal used cluster index.
|
| |
| cluster | clusterOf (node v) const |
| | Returns the cluster to which a node belongs.
|
| |
| int & | clusterDepth (cluster c) const |
| | Returns depth of cluster c in cluster tree, starting with root depth 1.
|
| |
| cluster | firstCluster () const |
| | Returns the first cluster in the list of all clusters.
|
| |
| cluster | lastCluster () const |
| | Returns the last cluster in the list of all cluster.
|
| |
| cluster | firstPostOrderCluster () const |
| | Returns the first cluster in the list of post ordered clusters.
|
| |
| template<class CLUSTERLIST > |
| void | allClusters (CLUSTERLIST &clusterList) const |
| | Returns the list of all clusters in clusterList.
|
| |
| const Graph * | getGraph () const |
| |
| void | clear () |
| | Removes all clusters except for the root cluster.
|
| |
| void | init (const Graph &G) |
| | Clears all cluster data and then reinitializes the instance with underlying graph G.
|
| |
| void | clearClusterTree (cluster C) |
| | Removes all clusters from the cluster subtree rooted at cluster C except for cluster C itself.
|
| |
| cluster | newCluster (cluster parent, int id=-1) |
| | Inserts a new cluster; makes it a child of the cluster parent.
|
| |
| cluster | createEmptyCluster (const cluster parent=nullptr, int clusterId=-1) |
| | Creates an empty cluster with index clusterId and parent parent.
|
| |
| cluster | createCluster (const SList< node > &nodes, const cluster parent=nullptr) |
| | Creates a new cluster containing the nodes given by nodes; makes it a child of the cluster parent.
|
| |
| void | delCluster (cluster c) |
| | Deletes cluster c.
|
| |
| void | moveCluster (cluster c, cluster newParent) |
| | Moves cluster c to a new parent newParent.
|
| |
| void | reassignNode (node v, cluster c) |
| | Reassigns node v to cluster c.
|
| |
| void | reInit (Graph &G) |
| | Clear cluster info structure, reinitializes with underlying graph G.
|
| |
| void | copyClusterTree (const ClusterGraph &C, const Graph &G, ClusterArray< cluster > &originalClusterTable, std::function< node(node)> nodeMap=[](node v) { return v;}) |
| | Constructs a cluster tree.
|
| |
| template<class NODELIST > |
| void | collapse (NODELIST &nodes, Graph &G) |
| | Collapses all nodes in the list nodes to the first node; multi-edges are removed.
|
| |
| cluster | chooseCluster (std::function< bool(cluster)> includeCluster=[](cluster) { return true;}, bool isFastTest=true) const |
| | Returns a random cluster.
|
| |
| void | setUpdateDepth (bool b) const |
| | Turns automatic update of node depth values on or off.
|
| |
| void | pullUpSubTree (cluster c) |
| | Updates depth information in subtree after delCluster.
|
| |
| int | treeDepth () const |
| | Computes depth of cluster tree, running time O(C).
|
| |
| void | computeSubTreeDepth (cluster c) const |
| | Computes depth of cluster tree hanging at c.
|
| |
| cluster | commonCluster (SList< node > &nodes) |
| | Returns lowest common cluster of nodes in list nodes.
|
| |
| cluster | commonCluster (node v, node w) const |
| | Returns the lowest common cluster of v and w in the cluster tree.
|
| |
| cluster | commonClusterLastAncestors (node v, node w, cluster &c1, cluster &c2) const |
| | Returns the lowest common cluster lca and the highest ancestors on the path to lca.
|
| |
| cluster | commonClusterPath (node v, node w, List< cluster > &eL) const |
| | Returns lca of v and w and stores corresponding path in eL.
|
| |
| cluster | commonClusterAncestorsPath (node v, node w, cluster &c1, cluster &c2, List< cluster > &eL) const |
| | Returns lca of v and w, stores corresponding path in eL and ancestors in c1, c2.
|
| |
| void | emptyClusters (SList< cluster > &emptyCluster, SList< cluster > *checkCluster=nullptr) |
| | Returns the list of clusters that are empty or only contain empty clusters.
|
| |
| bool | emptyOnNodeDelete (cluster c) |
| | Returns true if cluster c has only one node and no children.
|
| |
| bool | emptyOnClusterDelete (cluster c) |
| | Returns true if cluster c has only one child and no nodes.
|
| |
| template<class EDGELIST > |
| void | adjEdges (cluster c, EDGELIST &edges) const |
| | Returns the list of all edges adjacent to cluster c in edges.
|
| |
| template<class ADJLIST > |
| void | adjEntries (cluster c, ADJLIST &entries) const |
| | Returns the list of all adjacency entries adjacent to cluster c in entries.
|
| |
| template<class LISTITERATOR > |
| void | makeAdjEntries (cluster c, LISTITERATOR start) |
| | Computes the adjacency entry list for cluster c.
|
| |
| bool | adjAvailable () const |
| | Gets the availability status of the adjacency entries.
|
| |
| void | adjAvailable (bool val) |
| | Sets the availability status of the adjacency entries.
|
| |
| bool | representsCombEmbedding () const |
| | Checks the combinatorial cluster planar embedding.
|
| |
| bool | representsConnectedCombEmbedding () const |
| | Checks the combinatorial cluster planar embedding.
|
| |
| void | consistencyCheck () const |
| | Asserts consistency of this cluster graph.
|
| |
| | operator const Graph & () const |
| | Conversion to const Graph reference (to underlying graph).
|
| |
| const Graph & | constGraph () const |
| | Returns a reference to the underlying graph.
|
| |
| ClusterGraph & | operator= (const ClusterGraph &C) |
| | Assignment operator.
|
| |
| bool | isKeyAssociated (cluster key) const |
| |
| int | calculateArraySize (int add) const |
| |
| int | maxKeyIndex () const |
| |
| cluster_iterator | begin () const |
| |
| cluster_iterator | end () const |
| |
| | Observable ()=default |
| |
| | Observable (const Observable ©)=delete |
| | If you want to copy a subclass of Observable, call the default Observable() constructor.
|
| |
| | Observable (Observable &&move)=delete |
| | If you want to move a subclass of Observable, call the default Observable() constructor.
|
| |
| virtual | ~Observable () |
| | Note that all Observers must already be removed once the destructor of this base class is invoked (e.g.
|
| |
| Observable & | operator= (const Observable ©)=delete |
| |
| Observable & | operator= (Observable &&move)=delete |
| |
| virtual | ~RegistryBase () noexcept |
| | Destructor. Unregisters all associated arrays.
|
| |
| void | copyArrayEntries (int toIndex, int fromIndex) |
| | Copies the entry from fromIndex to toIndex in all registered arrays.
|
| |
| int | getArraySize () const |
| | Returns the current size of all registered arrays.
|
| |
| const registration_list_type & | getRegisteredArrays () const |
| | Returns a reference to the list of all registered arrays.
|
| |
| bool | isAutoShrink () const |
| | Returns whether the registry allows arrays to shrink when keys are removed.
|
| |
| void | keyAdded (Key key) |
| | Records the addition of a new key and resizes all registered arrays if necessary.
|
| |
| void | keyRemoved (Key key) |
| | Records the deletion of a key and resizes all registered arrays if auto shrink is enabled.
|
| |
| void | keysCleared () |
| | Records that all keys have been cleared. If auto shrink is enabled, all arrays are cleared and resized to 0.
|
| |
| void | moveRegisterArray (registration_iterator_type it, registered_array_type *pArray) const |
| | Stores array pArray at position it in the list of registered arrays.
|
| |
| OGDF_NODISCARD registration_iterator_type | registerArray (registered_array_type *pArray) const |
| | Registers a new array with this registry.
|
| |
| void | reserveSpace (int new_keys) |
| | Resizes all arrays to make space of new_keys new keys.
|
| |
| void | resizeArrays () |
| | Resizes all arrays to the size requested by calculateArraySize(). Only shrinks the arrays if auto shrink is enabled.
|
| |
| void | resizeArrays (int size) |
| | Resizes all arrays to size. Only shrinks the arrays if auto shrink is enabled.
|
| |
| void | resizeArrays (int size, bool shrink) |
| | Resizes all arrays to size. If shrink is true, the arrays may also shrink.
|
| |
| void | setAutoShrink (bool mAutoShrink) |
| | Specifies whether the registry allows arrays to shrink when keys are removed.
|
| |
| void | swapArrayEntries (int index1, int index2) |
| | Swaps the entries at index1 and index2 in all registered arrays.
|
| |
| void | unregisterArray (registration_iterator_type it) const noexcept |
| | Unregisters an array associated with this registry.
|
| |
| void | unregisterArrays () noexcept |
| | Unregister all associated arrays.
|
| |
| | Observable ()=default |
| |
| | Observable (const Observable ©)=delete |
| | If you want to copy a subclass of Observable, call the default Observable() constructor.
|
| |
| | Observable (Observable &&move)=delete |
| | If you want to move a subclass of Observable, call the default Observable() constructor.
|
| |
| virtual | ~Observable () |
| | Note that all Observers must already be removed once the destructor of this base class is invoked (e.g.
|
| |
| Observable & | operator= (const Observable ©)=delete |
| |
| Observable & | operator= (Observable &&move)=delete |
| |
|
| using | cluster_iterator = internal::GraphIterator< cluster > |
| | Provides a bidirectional iterator to a cluster in a clustered graph.
|
| |
| using | iterator_type = Iterator |
| |
| using | key_type = Key |
| |
| using | registered_array_type = internal::RegisteredArrayBase< Registry > |
| |
| using | registration_iterator_type = typename registration_list_type::iterator |
| |
| using | registration_list_type = std::list< registered_array_type *, OGDFAllocator< registered_array_type * > > |
| |
| using | registry_type = Registry |
| |
| static int | keyToIndex (cluster key) |
| |
| internal::GraphObjectContainer< ClusterElement > | clusters |
| | The container containing all cluster objects.
|
| |
| void | copyLCA (const ClusterGraph &C) |
| | Copies lowest common ancestor info to copy of clustered graph.
|
| |
| void | doClear () |
| | Clears all cluster data.
|
| |
| cluster | doCreateCluster (const SList< node > &nodes, const cluster parent, int clusterId=-1) |
| | Creates new cluster containing nodes in parameter list with index clusterId.
|
| |
| cluster | doCreateCluster (const SList< node > &nodes, SList< cluster > &emptyCluster, const cluster parent, int clusterId=-1) |
| | Creates new cluster containing nodes in parameter list and stores resulting empty clusters in list, cluster has index clusterId.
|
| |
| cluster | leftMostCluster (cluster c) const |
| | Leftmost cluster in subtree rooted at c, gets predecessor of subtree.
|
| |
| cluster | postOrderPredecessor (cluster c) const |
| | Computes new predecessor for subtree at moved cluster c (nullptr if c is the root).
|
| |
| void | updatePostOrder (cluster c, cluster oldParent, cluster newParent) |
| | Adjusts the post order structure for moved clusters.
|
| |
| void | nodeDeleted (node v) override |
| | Implementation of inherited method: Updates data if node deleted.
|
| |
| void | nodeAdded (node v) override |
| | Implementation of inherited method: Updates data if node added.
|
| |
| void | edgeDeleted (edge) override |
| | Implementation of inherited method: Updates data if edge deleted.
|
| |
| void | edgeAdded (edge) override |
| | Implementation of inherited method: Updates data if edge added.
|
| |
| void | cleared () override |
| | Clears cluster data without deleting root when underlying graphs' clear method is called.
|
| |
| void | registrationChanged (const Graph *newG) override |
| | Called after reregister() changed the observed instance.
|
| |
| void | clearObservers () |
| |
| const ListPure< ClusterGraphObserver * > & | getObservers () const |
| |
| ListPure< ClusterGraphObserver * >::iterator | registerObserver (ClusterGraphObserver *obs) const |
| | Registers an observer.
|
| |
| void | unregisterObserver (typename ListPure< ClusterGraphObserver * >::iterator it) const |
| | Unregisters an observer.
|
| |
| | RegistryBase ()=default |
| |
| void | clearObservers () |
| |
| const ListPure< RegisteredObserver< Registry > * > & | getObservers () const |
| |
| ListPure< RegisteredObserver< Registry > * >::iterator | registerObserver (RegisteredObserver< Registry > *obs) const |
| | Registers an observer.
|
| |
| void | unregisterObserver (typename ListPure< RegisteredObserver< Registry > * >::iterator it) const |
| | Unregisters an observer.
|
| |
| bool | m_depthUpToDate = false |
| | Status of cluster depth information.
|
| |
| int | m_lcaNumber = 0 |
| | Used to save last search run number for commoncluster.
|
| |
| std::unique_ptr< ClusterArray< int > > | m_lcaSearch |
| | Used to save last search run number for commoncluster.
|
| |
| bool | m_updateDepth = false |
| | Depth of clusters is always updated if set to true.
|
| |
| std::unique_ptr< ClusterArray< cluster > > | m_vAncestor |
| | Used to save last search run number for commoncluster.
|
| |
| std::unique_ptr< ClusterArray< cluster > > | m_wAncestor |
| | Used to save last search run number for commoncluster.
|
| |
| friend | Observer< ClusterGraph, ClusterGraphObserver > |
| |
| friend | Observer< ClusterGraph, RegisteredObserver< ClusterGraph > > |
| |
Inheritance diagram for ogdf::ClusterGraphCopy:
