Interface of algorithms for computing a node ranking. More...
#include <ogdf/layered/RankingModule.h>
Public Member Functions | |
RankingModule () | |
Initializes a ranking module. | |
virtual | ~RankingModule () |
virtual void | call (const Graph &G, const EdgeArray< int > &, const EdgeArray< int > &, NodeArray< int > &rank) |
virtual void | call (const Graph &G, NodeArray< int > &rank)=0 |
Computes a node ranking of the digraph G in rank . | |
void | operator() (const Graph &G, NodeArray< int > &rank) |
Computes a node ranking of the digraph G in rank . | |
Interface of algorithms for computing a node ranking.
Definition at line 44 of file RankingModule.h.
|
inline |
Initializes a ranking module.
Definition at line 47 of file RankingModule.h.
|
inlinevirtual |
Definition at line 49 of file RankingModule.h.
|
inlinevirtual |
Reimplemented in ogdf::LongestPathRanking, and ogdf::OptimalRanking.
Definition at line 62 of file RankingModule.h.
Computes a node ranking of the digraph G
in rank
.
This method is the actual algorithm call and must be implemented by derived classes.
G | is the input digraph. |
rank | is assigned the node ranking. |
Implemented in ogdf::CoffmanGrahamRanking, ogdf::LongestPathRanking, and ogdf::OptimalRanking.
Computes a node ranking of the digraph G
in rank
.
G | is the input digraph. |
rank | is assigned the node ranking. |
Definition at line 73 of file RankingModule.h.