Pertinent graphs of nodes in an SPQR-tree. More...
#include <ogdf/decomposition/PertinentGraph.h>
Public Member Functions | |
PertinentGraph () | |
Creates an empty instance of type PertinentGraph. More... | |
Graph & | getGraph () |
Returns a reference to G(vT). More... | |
const Graph & | getGraph () const |
Returns a reference to G(vT). More... | |
void | init (node vT) |
Initialization of a pertinent graph of tree node vT . More... | |
edge | original (edge e) const |
Returns the edge in G that corresponds to e . More... | |
node | original (node v) const |
Returns the vertex in G that corresponds to v . More... | |
edge | referenceEdge () const |
Returns the edge in G(vT) corresponding to the reference edge in skeleton of vT. More... | |
edge | skeletonReferenceEdge () const |
Returns the reference edge in skeleton of vT. More... | |
node | treeNode () const |
Returns the tree node vT in T whose pertinent graph is this one. More... | |
Protected Attributes | |
EdgeArray< edge > | m_origE |
corresp. More... | |
NodeArray< node > | m_origV |
corresp. More... | |
Graph | m_P |
actual graph More... | |
edge | m_skRefEdge |
reference edge (in skeleton(m_vT)) More... | |
edge | m_vEdge |
reference edge (in m_P) More... | |
node | m_vT |
corresponding tree node More... | |
Friends | |
class | SPQRTree |
Pertinent graphs of nodes in an SPQR-tree.
The class PertinentGraph represents the pertinent graph G(vT) of a node vT in an SPQR-tree T with original graph G.
The expansion graph E(e) of a virtual skeleton edge e is the skeleton graph of the twin e' of e without e', where each virtual edge eV again is replaced by its expansion graph E(eV). The pertinent graph G(vT) of a tree node vT is obtained from the skeleton S of vT, where each edge except for the reference edge of S is replaced by its expansion graph. Hence, if vT is not the root node of T, all but one edge in G(vT) correspond to real edges, otherwise all edges correspond to real edges.
If P is the pertinent graph of a PlanarSPQRTree, the underlying graph represents the combinatorial embedding which is implied by the embeddings of the skeletons of T.
Definition at line 59 of file PertinentGraph.h.
|
inline |
Creates an empty instance of type PertinentGraph.
Definition at line 72 of file PertinentGraph.h.
|
inline |
Returns a reference to G(vT).
Definition at line 90 of file PertinentGraph.h.
|
inline |
Returns a reference to G(vT).
Definition at line 87 of file PertinentGraph.h.
|
inline |
Initialization of a pertinent graph of tree node vT
.
Definition at line 75 of file PertinentGraph.h.
Returns the edge in G that corresponds to e
.
If e
is the reference edge, then 0 is returned.
e
is an edge in G(vT) Definition at line 116 of file PertinentGraph.h.
Returns the vertex in G that corresponds to v
.
v
is a node in G(vT) Definition at line 109 of file PertinentGraph.h.
|
inline |
Returns the edge in G(vT) corresponding to the reference edge in skeleton of vT.
If vT is the root of T, then 0 is returned.
Definition at line 96 of file PertinentGraph.h.
|
inline |
Returns the reference edge in skeleton of vT.
Notice that this edge may differ from the current reference edge in skeleton of vT if T has been rerooted after the construction of P.
Definition at line 103 of file PertinentGraph.h.
|
inline |
Returns the tree node vT in T whose pertinent graph is this one.
Definition at line 84 of file PertinentGraph.h.
|
friend |
Definition at line 60 of file PertinentGraph.h.
|
protected |
actual graph
Definition at line 120 of file PertinentGraph.h.
|
protected |
reference edge (in skeleton(m_vT))
Definition at line 122 of file PertinentGraph.h.
|
protected |
reference edge (in m_P)
Definition at line 121 of file PertinentGraph.h.
|
protected |
corresponding tree node
Definition at line 119 of file PertinentGraph.h.