Skeleton graphs of nodes in a dynamic SPQR-tree. More...
#include <ogdf/decomposition/DynamicSkeleton.h>
Inheritance diagram for ogdf::DynamicSkeleton:Public Member Functions | |
| DynamicSkeleton (const DynamicSPQRTree *T, node vT) | |
Creates a skeleton S with owner tree T and corresponding node vT. | |
| ~DynamicSkeleton () | |
| bool | isVirtual (edge e) const override |
Returns true iff e is a virtual edge. | |
| node | original (node v) const override |
Returns the vertex in the original graph G that corresponds to v. | |
| const SPQRTree & | owner () const override |
| Returns the owner tree T. | |
| edge | realEdge (edge e) const override |
Returns the real edge that corresponds to skeleton edge e. | |
| edge | twinEdge (edge e) const override |
Returns the twin edge of skeleton edge e. | |
| node | twinTreeNode (edge e) const override |
Returns the tree node in T containing the twin edge of skeleton edge e. | |
Public Member Functions inherited from ogdf::Skeleton | |
| Skeleton (node vT) | |
Creates a skeleton S with owner tree T and corresponding node vT. | |
| virtual | ~Skeleton () |
| Graph & | getGraph () |
| Returns a reference to the skeleton graph M. | |
| const Graph & | getGraph () const |
| Returns a reference to the skeleton graph M. | |
| edge | referenceEdge () const |
| Returns the reference edge of S in M. | |
| node | treeNode () const |
| Returns the corresponding node in the owner tree T to which S belongs. | |
Protected Attributes | |
| EdgeArray< edge > | m_origEdge |
| corresp. | |
| NodeArray< node > | m_origNode |
| corresp. | |
| const DynamicSPQRTree * | m_owner |
| owner tree | |
Protected Attributes inherited from ogdf::Skeleton | |
| Graph | m_M |
| actual skeleton graph | |
| edge | m_referenceEdge |
| reference edge | |
| node | m_treeNode |
| corresp. | |
Friends | |
| class | DynamicSPQRTree |
Skeleton graphs of nodes in a dynamic SPQR-tree.
The class DynamicSkeleton maintains the skeleton S of a node vT in a dynamic SPQR-tree T. We call T the owner tree of S and vT the corresponding tree node. Let G be the original graph of T.
S consists of an undirected multi-graph M. If the owner tree of S is a PlanarSPQRTree, then M represents a combinatorial embedding. The vertices in M correspond to vertices in G. The edges in M are of two types: Real edges correspond to edges in G and virtual edges correspond to tree-edges in T having vT as an endpoint.
Let e in M be a virtual edge and eT be the corresponding tree-edge. Then there exists exactly one edge e' in another skeleton S' of T that corresponds to eT as well. We call e' the twin edge of e.
Definition at line 62 of file DynamicSkeleton.h.
| ogdf::DynamicSkeleton::DynamicSkeleton | ( | const DynamicSPQRTree * | T, |
| node | vT | ||
| ) |
Creates a skeleton S with owner tree T and corresponding node vT.
vT is a node in T
|
inline |
Definition at line 78 of file DynamicSkeleton.h.
|
inlineoverridevirtual |
Returns true iff e is a virtual edge.
e is an edge in M Implements ogdf::Skeleton.
Definition at line 100 of file DynamicSkeleton.h.
Returns the vertex in the original graph G that corresponds to v.
v is a node in M. Implements ogdf::Skeleton.
|
overridevirtual |
Returns the owner tree T.
Implements ogdf::Skeleton.
Returns the real edge that corresponds to skeleton edge e.
If e is virtual edge, then 0 is returned.
e is an edge in M Implements ogdf::Skeleton.
Returns the twin edge of skeleton edge e.
If e is not a virtual edge, then 0 is returned.
e is an edge in M Implements ogdf::Skeleton.
Returns the tree node in T containing the twin edge of skeleton edge e.
If e is not a virtual edge, then 0 is returned.
e is an edge in M Implements ogdf::Skeleton.
|
friend |
Definition at line 63 of file DynamicSkeleton.h.
|
protected |
owner tree
Definition at line 119 of file DynamicSkeleton.h.