71 int size(
int i)
const {
return m_size[i]; }
Declaration and implementation of EdgeArray class.
Declaration of graph copy classes.
The parameterized class Array implements dynamic arrays of type E.
INDEX high() const
Returns the maximal array index.
Dynamic arrays indexed with edges.
Copies of graphs supporting edge splitting.
bool isDummy(node v) const
Returns true iff v has no corresponding node in the original graph.
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).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
int outdeg() const
Returns the outdegree of the node.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.