Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::Hierarchy Class Reference

Representation of proper hierarchies used by Sugiyama-layout. More...

#include <ogdf/layered/Hierarchy.h>

Public Member Functions

 Hierarchy ()
 Creates an empty hierarchy. More...
 
 Hierarchy (const Graph &G, const NodeArray< int > &rank)
 Creates an hierarchy of graph G with node ranks rank. More...
 
 ~Hierarchy ()
 
void createEmpty (const Graph &G)
 
void initByNodes (const List< node > &nodes, EdgeArray< edge > &eCopy, const NodeArray< int > &rank)
 
bool isLongEdgeDummy (node v) const
 
int maxRank () const
 
 operator const GraphCopy & () const
 Conversion to const GraphCopy reference. More...
 
int rank (node v) const
 Returns the rank (level) of node v. More...
 
int size (int i) const
 

Private Member Functions

void doInit (const NodeArray< int > &rank)
 

Private Attributes

GraphCopy m_GC
 The graph copy representing the topology of the proper hierarchy. More...
 
NodeArray< int > m_rank
 The rank (level) of a node. More...
 
Array< int > m_size
 

Friends

class LayerBasedUPRLayout
 

Detailed Description

Representation of proper hierarchies used by Sugiyama-layout.

See also
Level, SugiyamaLayout

Definition at line 44 of file Hierarchy.h.

Constructor & Destructor Documentation

◆ Hierarchy() [1/2]

ogdf::Hierarchy::Hierarchy ( )
inline

Creates an empty hierarchy.

Definition at line 54 of file Hierarchy.h.

◆ Hierarchy() [2/2]

ogdf::Hierarchy::Hierarchy ( const Graph G,
const NodeArray< int > &  rank 
)

Creates an hierarchy of graph G with node ranks rank.

◆ ~Hierarchy()

ogdf::Hierarchy::~Hierarchy ( )
inline

Definition at line 59 of file Hierarchy.h.

Member Function Documentation

◆ createEmpty()

void ogdf::Hierarchy::createEmpty ( const Graph G)

◆ doInit()

void ogdf::Hierarchy::doInit ( const NodeArray< int > &  rank)
private

◆ initByNodes()

void ogdf::Hierarchy::initByNodes ( const List< node > &  nodes,
EdgeArray< edge > &  eCopy,
const NodeArray< int > &  rank 
)

◆ isLongEdgeDummy()

bool ogdf::Hierarchy::isLongEdgeDummy ( node  v) const
inline

Definition at line 76 of file Hierarchy.h.

◆ maxRank()

int ogdf::Hierarchy::maxRank ( ) const
inline

Definition at line 72 of file Hierarchy.h.

◆ operator const GraphCopy &()

ogdf::Hierarchy::operator const GraphCopy & ( ) const
inline

Conversion to const GraphCopy reference.

Definition at line 67 of file Hierarchy.h.

◆ rank()

int ogdf::Hierarchy::rank ( node  v) const
inline

Returns the rank (level) of node v.

Definition at line 70 of file Hierarchy.h.

◆ size()

int ogdf::Hierarchy::size ( int  i) const
inline

Definition at line 74 of file Hierarchy.h.

Friends And Related Function Documentation

◆ LayerBasedUPRLayout

friend class LayerBasedUPRLayout
friend

Definition at line 46 of file Hierarchy.h.

Member Data Documentation

◆ m_GC

GraphCopy ogdf::Hierarchy::m_GC
private

The graph copy representing the topology of the proper hierarchy.

Definition at line 48 of file Hierarchy.h.

◆ m_rank

NodeArray<int> ogdf::Hierarchy::m_rank
private

The rank (level) of a node.

Definition at line 49 of file Hierarchy.h.

◆ m_size

Array<int> ogdf::Hierarchy::m_size
private

Definition at line 50 of file Hierarchy.h.


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