Includes declaration of graph class.
Basic declarations, included by all source files.
Data type for general directed graphs (adjacency list representation).
Interface of algorithms for computing a node ranking.
virtual void call(const Graph &G, NodeArray< int > &rank)=0
Computes a node ranking of the digraph G in rank.
RankingModule()
Initializes a ranking module.
void operator()(const Graph &G, NodeArray< int > &rank)
Computes a node ranking of the digraph G in rank.
virtual void call(const Graph &G, const EdgeArray< int > &, const EdgeArray< int > &, NodeArray< int > &rank)
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),...
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.