|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
64 void createEmpty(
const Graph& G);
75 int size(
int i)
const {
return m_size[i]; }
The namespace for all OGDF objects.
Includes declaration of graph class.
bool isDummy(node v) const
Returns true iff v has no corresponding node in the original graph.
Hierarchy()
Creates an empty hierarchy.
INDEX high() const
Returns the maximal array index.
Copies of graphs supporting edge splitting.
Representation of proper hierarchies used by Sugiyama-layout.
NodeArray< int > m_rank
The rank (level) of a node.
int outdeg() const
Returns the outdegree of the node.
Declaration of graph copy classes.
Doubly linked lists (maintaining the length of the list).
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
GraphCopy m_GC
The graph copy representing the topology of the proper hierarchy.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Declaration and implementation of Array class and Array algorithms.
bool isLongEdgeDummy(node v) const
int rank(node v) const
Returns the rank (level) of node v.
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.