Loading [MathJax]/extensions/tex2jax.js

Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
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
36namespace ogdf {
37
38
45public:
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}
Includes declaration of graph class.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
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.
Definition config.h:101
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:91
The namespace for all OGDF objects.