|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
47 #define OGDF_PCTREE_REUSE_NODES
69 size_t m_timestamp = 0;
73 #ifdef OGDF_PCTREE_REUSE_NODES
83 PCTreeForest(
bool autodelete =
true) : m_nodeArrayRegistry(this), m_autodelete(autodelete) {};
PCTreeForest(bool autodelete=true)
A PC-tree represents a set of cyclic orders of its leaves by labeling its inner nodes as either P- or...
A registry that allows labelling the nodes of a PC-tree.
PCTreeRegistry m_nodeArrayRegistry
Multiple PCTrees can be created within the same PCTreeForest, which allows merging the trees later on...
A Union/Find data structure for maintaining disjoint sets.
std::vector< PCNode * > m_cNodes
A registry that allows labelling the nodes of a PC-tree.
const UnionFindIndex UNIONFINDINDEX_EMPTY
A node in a PC-tree that is either a P-node, C-node or leaf.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
std::vector< PCTree * > m_trees
Implementation of disjoint sets data structures (union-find functionality).