Open
Graph Drawing
Framework

 v.2007.11
 

ogdf::PertinentGraph Class Reference

Pertinent graphs of nodes in an SPQR-tree. More...

#include <PertinentGraph.h>

List of all members.

Public Member Functions

 PertinentGraph ()
 Creates an empty instance of type PertinentGraph.
void init (node vT)
 Initialization of a pertinent graph of tree node vT.
node treeNode () const
 Returns the tree node vT in T whose pertinent graph is this one.
const GraphgetGraph () const
 Returns a reference to G(vT).
GraphgetGraph ()
 Returns a reference to G(vT).
edge referenceEdge () const
 Returns the edge in G(vT) corresponding to the reference edge in skeleton of vT.
edge skeletonReferenceEdge () const
 Returns the reference edge in skeleton of vT.
node original (node v) const
 Returns the vertex in G that corresponds to v.
edge original (edge e) const
 Returns the edge in G that corresponds to e.

Protected Attributes

node m_vT
 corresponding tree node
Graph m_P
 actual graph
edge m_vEdge
 reference edge (in m_P)
edge m_skRefEdge
 reference edge (in skeleton(m_vT))
NodeArray< nodem_origV
 corresp. original node
EdgeArray< edgem_origE
 corresp. original edge

Friends

class SPQRTree


Detailed Description

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 87 of file PertinentGraph.h.


Constructor & Destructor Documentation

ogdf::PertinentGraph::PertinentGraph (  )  [inline]

Creates an empty instance of type PertinentGraph.

Remarks:
Pertinent graphs are created by the pertinentGraph() function of SPQRTree.

Definition at line 102 of file PertinentGraph.h.


Member Function Documentation

void ogdf::PertinentGraph::init ( node  vT  )  [inline]

Initialization of a pertinent graph of tree node vT.

Definition at line 105 of file PertinentGraph.h.

node ogdf::PertinentGraph::treeNode (  )  const [inline]

Returns the tree node vT in T whose pertinent graph is this one.

Definition at line 115 of file PertinentGraph.h.

const Graph& ogdf::PertinentGraph::getGraph (  )  const [inline]

Returns a reference to G(vT).

Definition at line 120 of file PertinentGraph.h.

Graph& ogdf::PertinentGraph::getGraph (  )  [inline]

Returns a reference to G(vT).

Definition at line 125 of file PertinentGraph.h.

edge ogdf::PertinentGraph::referenceEdge (  )  const [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 133 of file PertinentGraph.h.

edge ogdf::PertinentGraph::skeletonReferenceEdge (  )  const [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 142 of file PertinentGraph.h.

node ogdf::PertinentGraph::original ( node  v  )  const [inline]

Returns the vertex in G that corresponds to v.

Precondition:
v is a node in G(vT)

Definition at line 150 of file PertinentGraph.h.

edge ogdf::PertinentGraph::original ( edge  e  )  const [inline]

Returns the edge in G that corresponds to e.

If e is the reference edge, then 0 is returned.

Precondition:
e is an edge in G(vT)

Definition at line 159 of file PertinentGraph.h.


Friends And Related Function Documentation

friend class SPQRTree [friend]

Definition at line 89 of file PertinentGraph.h.


Member Data Documentation

node ogdf::PertinentGraph::m_vT [protected]

corresponding tree node

Definition at line 164 of file PertinentGraph.h.

Graph ogdf::PertinentGraph::m_P [protected]

actual graph

Definition at line 165 of file PertinentGraph.h.

edge ogdf::PertinentGraph::m_vEdge [protected]

reference edge (in m_P)

Definition at line 166 of file PertinentGraph.h.

edge ogdf::PertinentGraph::m_skRefEdge [protected]

reference edge (in skeleton(m_vT))

Definition at line 167 of file PertinentGraph.h.

NodeArray<node> ogdf::PertinentGraph::m_origV [protected]

corresp. original node

Definition at line 169 of file PertinentGraph.h.

EdgeArray<edge> ogdf::PertinentGraph::m_origE [protected]

corresp. original edge

Definition at line 170 of file PertinentGraph.h.


The documentation for this class was generated from the following file:

© 1999-2007 by oreas GmbH, © 2005-2007 by University Dortmund and University Cologne.

Generated on Thu Nov 22 19:40:09 2007 by doxygen 1.5.4.