75 int size(
int i)
const {
return m_size[i]; }
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declaration of graph copy classes.
Basic declarations, included by all source files.
The parameterized class Array implements dynamic arrays of type E.
INDEX high() const
Returns the maximal array index.
bool isDummy(node v) const
Returns true iff v has no corresponding node in the original graph.
Copies of graphs supporting edge splitting.
Data type for general directed graphs (adjacency list representation).
Representation of proper hierarchies used by Sugiyama-layout.
NodeArray< int > m_rank
The rank (level) of a node.
void initByNodes(const List< node > &nodes, EdgeArray< edge > &eCopy, const NodeArray< int > &rank)
Hierarchy(const Graph &G, const NodeArray< int > &rank)
Creates an hierarchy of graph G with node ranks rank.
bool isLongEdgeDummy(node v) const
int rank(node v) const
Returns the rank (level) of node v.
Hierarchy()
Creates an empty hierarchy.
void doInit(const NodeArray< int > &rank)
void createEmpty(const Graph &G)
GraphCopy m_GC
The graph copy representing the topology of the proper hierarchy.
Doubly linked lists (maintaining the length of the list).
Class for the representation of nodes.
int outdeg() const
Returns the outdegree of the node.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#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.