|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
Includes declaration of graph class.
Interface of algorithms for computing a node ranking.
RankingModule()
Initializes a ranking module.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
virtual void call(const Graph &G, const EdgeArray< int > &, const EdgeArray< int > &, NodeArray< int > &rank)
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
void operator()(const Graph &G, NodeArray< int > &rank)
Computes a node ranking of the digraph G in rank.
Declaration of memory manager for allocating small pieces of memory.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.