Includes declaration of graph class.
Dynamic arrays indexed with edges.
Data type for general directed graphs (adjacency list representation).
Dynamic arrays indexed with nodes.
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)
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
The namespace for all OGDF objects.