Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::HierarchyLevelsBase Class Referenceabstract

#include <ogdf/layered/CrossingMinInterfaces.h>

+ Inheritance diagram for ogdf::HierarchyLevelsBase:

Public Types

enum  TraversingDir { TraversingDir::downward, TraversingDir::upward }
 

Public Member Functions

 HierarchyLevelsBase ()=default
 
 HierarchyLevelsBase (const HierarchyLevelsBase &)=default
 
virtual ~HierarchyLevelsBase ()
 
virtual const Array< node > & adjNodes (node v, TraversingDir dir) const =0
 Returns the adjacent nodes of v. More...
 
int calculateCrossings () const
 Computes the total number of crossings. More...
 
int calculateCrossings (int i) const
 Computes the number of crossings between level i and i+1. More...
 
virtual const Hierarchyhierarchy () const =0
 
virtual int high () const
 Returns the maximal array index of a level (= size()-1). More...
 
HierarchyLevelsBaseoperator= (const HierarchyLevelsBase &)=default
 
virtual const LevelBaseoperator[] (int i) const =0
 Returns the i-th level. More...
 
virtual int pos (node v) const =0
 Returns the position of node v on its level. More...
 
virtual int size () const =0
 Returns the number of levels. More...
 

Detailed Description

Definition at line 65 of file CrossingMinInterfaces.h.

Member Enumeration Documentation

◆ TraversingDir

Enumerator
downward 
upward 

Definition at line 76 of file CrossingMinInterfaces.h.

Constructor & Destructor Documentation

◆ HierarchyLevelsBase() [1/2]

ogdf::HierarchyLevelsBase::HierarchyLevelsBase ( )
default

◆ HierarchyLevelsBase() [2/2]

ogdf::HierarchyLevelsBase::HierarchyLevelsBase ( const HierarchyLevelsBase )
default

◆ ~HierarchyLevelsBase()

virtual ogdf::HierarchyLevelsBase::~HierarchyLevelsBase ( )
inlinevirtual

Definition at line 74 of file CrossingMinInterfaces.h.

Member Function Documentation

◆ adjNodes()

virtual const Array<node>& ogdf::HierarchyLevelsBase::adjNodes ( node  v,
TraversingDir  dir 
) const
pure virtual

Returns the adjacent nodes of v.

Implemented in ogdf::BlockOrder.

◆ calculateCrossings() [1/2]

int ogdf::HierarchyLevelsBase::calculateCrossings ( ) const

Computes the total number of crossings.

◆ calculateCrossings() [2/2]

int ogdf::HierarchyLevelsBase::calculateCrossings ( int  i) const

Computes the number of crossings between level i and i+1.

◆ hierarchy()

virtual const Hierarchy& ogdf::HierarchyLevelsBase::hierarchy ( ) const
pure virtual

◆ high()

virtual int ogdf::HierarchyLevelsBase::high ( ) const
inlinevirtual

Returns the maximal array index of a level (= size()-1).

Reimplemented in ogdf::HierarchyLevels.

Definition at line 88 of file CrossingMinInterfaces.h.

◆ operator=()

HierarchyLevelsBase& ogdf::HierarchyLevelsBase::operator= ( const HierarchyLevelsBase )
default

◆ operator[]()

virtual const LevelBase& ogdf::HierarchyLevelsBase::operator[] ( int  i) const
pure virtual

Returns the i-th level.

Implemented in ogdf::BlockOrder, and ogdf::HierarchyLevels.

◆ pos()

virtual int ogdf::HierarchyLevelsBase::pos ( node  v) const
pure virtual

Returns the position of node v on its level.

Implemented in ogdf::BlockOrder, and ogdf::HierarchyLevels.

◆ size()

virtual int ogdf::HierarchyLevelsBase::size ( ) const
pure virtual

Returns the number of levels.

Implemented in ogdf::BlockOrder, and ogdf::HierarchyLevels.


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