Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

RankingModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph.h>
35 
36 namespace ogdf {
37 
38 
45 public:
48 
49  virtual ~RankingModule() { }
50 
60  virtual void call(const Graph& G, NodeArray<int>& rank) = 0;
61 
62  virtual void call(const Graph& G, const EdgeArray<int>& /* length */,
63  const EdgeArray<int>& /* cost */, NodeArray<int>& rank) {
64  call(G, rank);
65  }
66 
73  void operator()(const Graph& G, NodeArray<int>& rank) { call(G, rank); }
74 
76 };
77 
78 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::RankingModule::~RankingModule
virtual ~RankingModule()
Definition: RankingModule.h:49
ogdf::RankingModule
Interface of algorithms for computing a node ranking.
Definition: RankingModule.h:44
ogdf::RankingModule::RankingModule
RankingModule()
Initializes a ranking module.
Definition: RankingModule.h:47
OGDF_MALLOC_NEW_DELETE
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition: memory.h:91
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:651
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::RankingModule::call
virtual void call(const Graph &G, const EdgeArray< int > &, const EdgeArray< int > &, NodeArray< int > &rank)
Definition: RankingModule.h:62
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::RankingModule::operator()
void operator()(const Graph &G, NodeArray< int > &rank)
Computes a node ranking of the digraph G in rank.
Definition: RankingModule.h:73
ogdf::internal::EdgeArrayBase2
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition: Graph_d.h:709