|
|||
|
|
|
|||
|
|
Triangulating BFS tree that operates on a non-triangulated graph and constructs the triangulation together with the BFS, which should lead to broader trees. More...
#include <ogdf/graphalg/SeparatorLiptonTarjanFC.h>
Inheritance diagram for ogdf::planar_separators::TriangulatingBFSTree:Public Member Functions | |
| TriangulatingBFSTree (GraphCopy &G, node rootNode) | |
| Constructor. More... | |
| void | construct () |
| void | visit (node v, node parent, adjEntry adj, SListPure< node > &bfs) |
| Public Member Functions inherited from ogdf::planar_separators::ArrayBFSTree | |
| ArrayBFSTree (GraphCopy &G, node rootNode) | |
| Constructor. More... | |
| adjEntry | getAdjToParent (node n) const override |
Returns the adjEntry that leads up to the parent of n. More... | |
| List< node > | getChildrenOfNode (node n) const override |
| Returns all (immediate) children of a node. More... | |
| int | getDescendantsOfNode (node n) const override |
| Returns the total number of children, grandchildren etc. More... | |
| GraphCopy * | getGraph () const override |
| Allows access to a copy of the graph. More... | |
| int | getGraphSize () const override |
| Gets the number of nodes of the graph. More... | |
| int | getLevelOfNode (node n) const override |
| Returns the level (=depth in the tree) for a node. More... | |
| node | getParentOfNode (node n) const override |
Returns the node that is the parent of n in the tree. More... | |
| node | getRoot () const override |
| Gets the current root node of the tree. More... | |
| void | init () |
| Initializes all internal arrays. More... | |
| bool | isInTree (edge e) const override |
| Checks if an edge is a tree-edge. More... | |
| Public Member Functions inherited from ogdf::planar_separators::BFSTree | |
| virtual | ~BFSTree ()=default |
Additional Inherited Members | |
| Protected Attributes inherited from ogdf::planar_separators::ArrayBFSTree | |
| NodeArray< List< node > > | childrenOfNode |
| NodeArray< int > | descendantsOfNode |
| NodeArray< adjEntry > | edgeToParent |
| EdgeArray< bool > | inTree |
| NodeArray< int > | levelOfNode |
| NodeArray< bool > | mark |
| NodeArray< node > | parentOfNode |
| GraphCopy * | pGraph |
| node | root |
Triangulating BFS tree that operates on a non-triangulated graph and constructs the triangulation together with the BFS, which should lead to broader trees.
Definition at line 70 of file SeparatorLiptonTarjanFC.h.
|
inline |
Constructor.
| G | the graph |
| rootNode | the node at which the tree should be rooted |
Definition at line 78 of file SeparatorLiptonTarjanFC.h.
| void ogdf::planar_separators::TriangulatingBFSTree::construct | ( | ) |
| void ogdf::planar_separators::TriangulatingBFSTree::visit | ( | node | v, |
| node | parent, | ||
| adjEntry | adj, | ||
| SListPure< node > & | bfs | ||
| ) |
