57 virtual int size()
const = 0;
60 virtual int high()
const = 0;
82 virtual int size()
const = 0;
85 virtual int high()
const {
return size() - 1; }
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Basic declarations, included by all source files.
The parameterized class Array implements dynamic arrays of type E.
Representation of proper hierarchies used by Sugiyama-layout.
HierarchyLevelsBase()=default
int calculateCrossings(int i) const
Computes the number of crossings between level i and i+1.
HierarchyLevelsBase(const HierarchyLevelsBase &)=default
virtual const Array< node > & adjNodes(node v, TraversingDir dir) const =0
Returns the adjacent nodes of v.
virtual const Hierarchy & hierarchy() const =0
HierarchyLevelsBase & operator=(const HierarchyLevelsBase &)=default
int calculateCrossings() const
Computes the total number of crossings.
virtual int size() const =0
Returns the number of levels.
virtual const LevelBase & operator[](int i) const =0
Returns the i-th level.
virtual int high() const
Returns the maximal array index of a level (= size()-1).
virtual int pos(node v) const =0
Returns the position of node v on its level.
virtual ~HierarchyLevelsBase()
Representation of levels in hierarchies.
virtual int high() const =0
Returns the maximal array index (= size()-1).
virtual node & operator[](int i)=0
Returns the node at position i.
virtual int size() const =0
Returns the number of nodes on this level.
virtual const node & operator[](int i) const =0
Returns the node at position i.
Class for the representation of nodes.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.