Open
Graph Drawing
Framework

 v.2012.05
 

ogdf::ShellingOrder Class Reference

The shelling order of a graph. More...

#include <ogdf/planarlayout/ShellingOrder.h>

List of all members.

Public Member Functions

 ShellingOrder ()
 Creates an empty shelling order.
 ~ShellingOrder ()
const GraphgetGraph () const
 Returns the graph associated with the shelling order.
int length () const
 Returns the number of sets in the node partition.
int len (int i) const
 Returns the length of the i-th order set Vi.
node operator() (int i, int j) const
 Returns the j-th node of the i-th order set Vi.
const ShellingOrderSetoperator[] (int i) const
 Returns the i-th set V_i
node left (int i) const
 Returns the left-node of the i-th set Vi.
node right (int i) const
 Returns the right-node of the i-th set Vi.
int rank (node v) const
 Returns the rank of node v, where rank(v) = i iff v is contained in Vi.
void init (const Graph &G, const List< ShellingOrderSet > &partition)
 Initializes the shelling order for graph G with a given node partition.
void initLeftmost (const Graph &G, const List< ShellingOrderSet > &partition)
 Initializes the shelling order for graph G with a given node partition and transforms it into a leftmost order.
void push (int k, node v, node tgt)

Private Attributes

const Graphm_pGraph
 the associated graph.
Array< ShellingOrderSetm_V
 the node partition.
NodeArray< int > m_rank
 the rank of nodes.

Friends

class CompOrderBic

Detailed Description

The shelling order of a graph.

Definition at line 175 of file ShellingOrder.h.


Constructor & Destructor Documentation

Creates an empty shelling order.

Definition at line 180 of file ShellingOrder.h.

Definition at line 187 of file ShellingOrder.h.


Member Function Documentation

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

Returns the graph associated with the shelling order.

Definition at line 192 of file ShellingOrder.h.

void ogdf::ShellingOrder::init ( const Graph G,
const List< ShellingOrderSet > &  partition 
)

Initializes the shelling order for graph G with a given node partition.

Parameters:
Gis the associated graph.
partitionis the node partition.
void ogdf::ShellingOrder::initLeftmost ( const Graph G,
const List< ShellingOrderSet > &  partition 
)

Initializes the shelling order for graph G with a given node partition and transforms it into a leftmost order.

Parameters:
Gis the associated graph.
partitionis the node partition.
node ogdf::ShellingOrder::left ( int  i) const [inline]

Returns the left-node of the i-th set Vi.

Definition at line 217 of file ShellingOrder.h.

int ogdf::ShellingOrder::len ( int  i) const [inline]

Returns the length of the i-th order set Vi.

Definition at line 202 of file ShellingOrder.h.

int ogdf::ShellingOrder::length ( ) const [inline]

Returns the number of sets in the node partition.

Definition at line 197 of file ShellingOrder.h.

node ogdf::ShellingOrder::operator() ( int  i,
int  j 
) const [inline]

Returns the j-th node of the i-th order set Vi.

Definition at line 207 of file ShellingOrder.h.

const ShellingOrderSet& ogdf::ShellingOrder::operator[] ( int  i) const [inline]

Returns the i-th set V_i

Definition at line 212 of file ShellingOrder.h.

void ogdf::ShellingOrder::push ( int  k,
node  v,
node  tgt 
)
int ogdf::ShellingOrder::rank ( node  v) const [inline]

Returns the rank of node v, where rank(v) = i iff v is contained in Vi.

Definition at line 227 of file ShellingOrder.h.

node ogdf::ShellingOrder::right ( int  i) const [inline]

Returns the right-node of the i-th set Vi.

Definition at line 222 of file ShellingOrder.h.


Friends And Related Function Documentation

friend class CompOrderBic [friend]

Definition at line 249 of file ShellingOrder.h.


Member Data Documentation

the associated graph.

Definition at line 252 of file ShellingOrder.h.

the rank of nodes.

Definition at line 254 of file ShellingOrder.h.

the node partition.

Definition at line 253 of file ShellingOrder.h.


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