Open Graph Drawing Framework  v.2007.11

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

ogdf::BiconnectedShellingOrder Class Reference

Computation of the shelling order for biconnected graphs. More...

#include <BiconnectedShellingOrder.h>

Inheritance diagram for ogdf::BiconnectedShellingOrder:

List of all members.

Public Member Functions
	BiconnectedShellingOrder ()
	Creates a biconnected shelling order module.
Protected Member Functions
virtual void	doCall (const Graph &G, adjEntry adj, List< ShellingOrderSet > &partition)
	The actual implementation of the module call.

---

Detailed Description

Computation of the shelling order for biconnected graphs.

Precondition:

The input graph has to be simple (no multi-edges, no self-loops), planar and biconnected.

Definition at line 71 of file BiconnectedShellingOrder.h.

---

Constructor & Destructor Documentation

ogdf::BiconnectedShellingOrder::BiconnectedShellingOrder

(

)

[inline]

Creates a biconnected shelling order module.

Definition at line 75 of file BiconnectedShellingOrder.h.

---

Member Function Documentation

virtual void ogdf::BiconnectedShellingOrder::doCall	(	const Graph &	G,
		adjEntry	adj,
		List< ShellingOrderSet > &	partition
	)			[protected, virtual]

The actual implementation of the module call.

Implements ogdf::ShellingOrderModule.

---

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

• ogdf/planarlayout/BiconnectedShellingOrder.h

---