#include <DynamicSkeleton.h>

Public Member Functions | |
| DynamicSkeleton (const DynamicSPQRTree *T, node vT) | |
| Creates a skeleton S with owner tree T and corresponding node vT. | |
| ~DynamicSkeleton () | |
| const SPQRTree & | owner () const |
| Returns the owner tree T. | |
| node | original (node v) const |
| Returns the vertex in the original graph G that corresponds to v. | |
| edge | realEdge (edge e) const |
| Returns the real edge that corresponds to skeleton edge e. | |
| bool | isVirtual (edge e) const |
| Returns true iff e is a virtual edge. | |
| edge | twinEdge (edge e) const |
| Returns the twin edge of skeleton edge e. | |
| node | twinTreeNode (edge e) const |
| Returns the tree node in T containing the twin edge of skeleton edge e. | |
Protected Attributes | |
| const DynamicSPQRTree * | m_owner |
| owner tree | |
| NodeArray< node > | m_origNode |
| corresp. original node | |
| EdgeArray< edge > | m_origEdge |
| corresp. original edge | |
Friends | |
| class | DynamicSPQRTree |
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 84 of file DynamicSkeleton.h.
| ogdf::DynamicSkeleton::DynamicSkeleton | ( | const DynamicSPQRTree * | T, | |
| node | vT | |||
| ) |
Creates a skeleton S with owner tree T and corresponding node vT.
| ogdf::DynamicSkeleton::~DynamicSkeleton | ( | ) | [inline] |
Definition at line 103 of file DynamicSkeleton.h.
| const SPQRTree& ogdf::DynamicSkeleton::owner | ( | ) | const [virtual] |
Returns the vertex in the original graph G that corresponds to v.
Implements ogdf::Skeleton.
Returns the real edge that corresponds to skeleton edge e.
If e is virtual edge, then 0 is returned.
Implements ogdf::Skeleton.
| bool ogdf::DynamicSkeleton::isVirtual | ( | edge | e | ) | const [inline, virtual] |
Returns true iff e is a virtual edge.
Implements ogdf::Skeleton.
Definition at line 126 of file DynamicSkeleton.h.
Returns the twin edge of skeleton edge e.
If e is not a virtual edge, then 0 is returned.
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.
Implements ogdf::Skeleton.
friend class DynamicSPQRTree [friend] |
Definition at line 86 of file DynamicSkeleton.h.
const DynamicSPQRTree* ogdf::DynamicSkeleton::m_owner [protected] |
NodeArray<node> ogdf::DynamicSkeleton::m_origNode [protected] |
EdgeArray<edge> ogdf::DynamicSkeleton::m_origEdge [protected] |