|
|||
|
|
|
|||
|
|
Namespaces | |
| uid_utils | |
| Functions that can be passed to PCTree::uniqueID() | |
Classes | |
| class | FilteringPCTreeWalk |
| A DFS or BFS through a PCTree. More... | |
| struct | GraphNotPlanarException |
| class | IntrusiveList |
| class | NodePCRotation |
| This class represents the embedding tree of a single node in a biconnected component. More... | |
| class | PCNode |
| A node in a PC-tree that is either a P-node, C-node or leaf. More... | |
| struct | PCNodeChildrenIterable |
| class | PCNodeIterator |
| struct | PCNodeNeighborsIterable |
| class | PCTree |
| A PC-tree represents a set of cyclic orders of its leaves by labeling its inner nodes as either P- or C-node and allowing arbitrary permutations of the neighbors of P-nodes while only allowing flips of C-nodes. More... | |
| class | PCTreeForest |
| Multiple PCTrees can be created within the same PCTreeForest, which allows merging the trees later on by making one a child of another. More... | |
| class | PCTreeRegistry |
| A registry that allows labelling the nodes of a PC-tree. More... | |
Typedefs | |
| using | FilteringPCTreeBFS = FilteringPCTreeWalk< false > |
| using | FilteringPCTreeDFS = FilteringPCTreeWalk< true > |
| template<typename Value , bool WithDefault = true> | |
| using | PCTreeNodeArray = ogdf::RegisteredArray< PCTreeRegistry, Value, WithDefault > |
| template<typename Value > | |
| using | PCTreeNodeArrayP = PCTreeNodeArray< std::unique_ptr< Value >, false > |
| Shorthand for PCTreeNodeArray storing std::unique_ptr<Value>. More... | |
| template<bool SupportFastSizeQuery = true> | |
| using | PCTreeNodeSet = ogdf::RegisteredSet< PCTreeRegistry, SupportFastSizeQuery > |
| using | UnionFindIndex = size_t |
Enumerations | |
| enum | NodeLabel { NodeLabel::Unknown, NodeLabel::Partial, NodeLabel::Full, NodeLabel::Empty = Unknown } |
| enum | PCNodeType { PCNodeType::PNode, PCNodeType::CNode, PCNodeType::Leaf } |
Functions | |
| int | factorial (int n) |
Returns n!. More... | |
| bool | isTrivialRestriction (int restSize, int leafCount) |
| std::ostream & | operator<< (std::ostream &, const ogdf::pc_tree::PCNode &) |
| std::ostream & | operator<< (std::ostream &, const ogdf::pc_tree::PCNode *) |
| std::ostream & | operator<< (std::ostream &, const ogdf::pc_tree::PCTree &) |
| std::ostream & | operator<< (std::ostream &, const ogdf::pc_tree::PCTree *) |
| std::ostream & | operator<< (std::ostream &, ogdf::pc_tree::NodeLabel) |
| std::ostream & | operator<< (std::ostream &, ogdf::pc_tree::PCNodeType) |
| void | proceedToNextSibling (PCNode *&pred, PCNode *&curr) |
Iteration-convenience version of PCNode::getNextSibling() that updates the variables pred to curr and curr to the value returned by PCNode::getNextSibling(pred, curr). More... | |
Variables | |
| int | PCTREE_DEBUG_CHECK_FREQ |
| Allows controlling the frequency of full-tree consistency checks in heavy debug mode. More... | |
| const UnionFindIndex | UNIONFINDINDEX_EMPTY = std::numeric_limits<UnionFindIndex>::max() |
| using ogdf::pc_tree::FilteringPCTreeBFS = typedef FilteringPCTreeWalk<false> |
Definition at line 215 of file PCTreeIterators.h.
| using ogdf::pc_tree::FilteringPCTreeDFS = typedef FilteringPCTreeWalk<true> |
Definition at line 214 of file PCTreeIterators.h.
| using ogdf::pc_tree::PCTreeNodeArray = typedef ogdf::RegisteredArray<PCTreeRegistry, Value , WithDefault > |
| using ogdf::pc_tree::PCTreeNodeArrayP = typedef PCTreeNodeArray <std::unique_ptr<Value>, false> |
Shorthand for PCTreeNodeArray storing std::unique_ptr<Value>.
You may need to explicitly delete the copy constructor of classes containing a member of this type for MSVC<=16 (e.g. using OGDF_NO_COPY(MyClass)).
| using ogdf::pc_tree::PCTreeNodeSet = typedef ogdf::RegisteredSet<PCTreeRegistry, SupportFastSizeQuery> |
| using ogdf::pc_tree::UnionFindIndex = typedef size_t |
Definition at line 44 of file PCTreeForest.h.
|
strong |
|
strong |
|
inline |
| bool ogdf::pc_tree::isTrivialRestriction | ( | int | restSize, |
| int | leafCount | ||
| ) |
true if calling PCTree::makeConsecutive() with restSize out of leafCount total leaves never requires changes to the tree. This is the case for restSize values 0, 1, leafCount - 1, and leafCount. | std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| const ogdf::pc_tree::PCNode & | |||
| ) |
| std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| const ogdf::pc_tree::PCNode * | |||
| ) |
| std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| const ogdf::pc_tree::PCTree & | |||
| ) |
| std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| const ogdf::pc_tree::PCTree * | |||
| ) |
| std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| ogdf::pc_tree::NodeLabel | |||
| ) |
| std::ostream& ogdf::pc_tree::operator<< | ( | std::ostream & | , |
| ogdf::pc_tree::PCNodeType | |||
| ) |
Iteration-convenience version of PCNode::getNextSibling() that updates the variables pred to curr and curr to the value returned by PCNode::getNextSibling(pred, curr).
| int ogdf::pc_tree::PCTREE_DEBUG_CHECK_FREQ |
Allows controlling the frequency of full-tree consistency checks in heavy debug mode.
When set to a non-zero value n, only every n'th check will be performed. When set to 1, every check will be executed. When set to 0, entirely skips the checks. Defaults to n=10.
| const UnionFindIndex ogdf::pc_tree::UNIONFINDINDEX_EMPTY = std::numeric_limits<UnionFindIndex>::max() |
Definition at line 46 of file PCTreeForest.h.