Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
RankingModule.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
36#include <ogdf/basic/memory.h>
37
38namespace ogdf {
39
40
47public:
50
51 virtual ~RankingModule() { }
52
62 virtual void call(const Graph& G, NodeArray<int>& rank) = 0;
63
64 virtual void call(const Graph& G, const EdgeArray<int>& /* length */,
65 const EdgeArray<int>& /* cost */, NodeArray<int>& rank) {
66 call(G, rank);
67 }
68
75 void operator()(const Graph& G, NodeArray<int>& rank) { call(G, rank); }
76
78};
79
80}
Includes declaration of graph class.
Basic declarations, included by all source files.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
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>.
Definition Graph_d.h:717
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:92
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.