Open Graph Drawing Framework  v.2007.11

Overview Class Hierarchy Class Index Class List Members Namespaces Source Files Search for:

ogdf::DynamicPlanarSPQRTree Class Reference

SPQR-trees of planar graphs. More...

#include <DynamicPlanarSPQRTree.h>

Inheritance diagram for ogdf::DynamicPlanarSPQRTree:

List of all members.

Public Member Functions
	DynamicPlanarSPQRTree (Graph &G, bool isEmbedded=false)
	Creates an SPQR tree T for planar graph G rooted at the first edge of G.
	DynamicPlanarSPQRTree (Graph &G, edge e, bool isEmbedded=false)
	Creates an SPQR tree T for planar graph G rooted at edge e.

---

Detailed Description

SPQR-trees of planar graphs.

The class DynamicPlanarSPQRTree maintains the triconnected components of a planar biconnected graph G and represents all possible embeddings of G. Each skeleton graph is embedded.

The current embeddings of the skeletons define an embedding of G. There are two basic operations for obtaining another embedding of G: reverse(v), which flips the skeleton of an R-node v around its poles, and swap(v,e_1,e_2), which exchanges the positions of the edges e_1 and e_2 in the skeleton of a P-node v.

Definition at line 89 of file DynamicPlanarSPQRTree.h.

---

Constructor & Destructor Documentation

ogdf::DynamicPlanarSPQRTree::DynamicPlanarSPQRTree	(	Graph &	G,
		bool	isEmbedded = false
	)			[inline]

Creates an SPQR tree T for planar graph G rooted at the first edge of G.

If isEmbedded is set to true, G must represent a combinatorial embedding, i.e., the counter-clockwise order of the adjacency entries around each vertex defines an embedding.

Precondition:

G is planar and biconnected and contains at least 3 nodes, or G has exactly 2 nodes and at least 3 edges.

Definition at line 103 of file DynamicPlanarSPQRTree.h.

ogdf::DynamicPlanarSPQRTree::DynamicPlanarSPQRTree	(	Graph &	G,
		edge	e,
		bool	isEmbedded = false
	)			[inline]

Creates an SPQR tree T for planar graph G rooted at edge e.

If isEmbedded is set to true, G must represent a combinatorial embedding, i.e., the counter-clockwise order of the adjacency entries around each vertex defines an embedding.

Precondition:

e is an edge in G, and G is planar and biconnected and contains at least 3 nodes, or G has exactly 2 nodes and at least 3 edges.

Definition at line 118 of file DynamicPlanarSPQRTree.h.

---

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

• ogdf/decomposition/DynamicPlanarSPQRTree.h

---