|
|||
|
|
|
|||
|
|
Interface of algorithms for computing a node ranking. More...
#include <ogdf/module/RankingModule.h>
Public Member Functions | |
| RankingModule () | |
| Initializes a ranking module. | |
| virtual | ~RankingModule () |
| virtual void | call (const Graph &G, NodeArray< int > &rank)=0 |
| 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) |
| 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 63 of file RankingModule.h.
| ogdf::RankingModule::RankingModule | ( | ) | [inline] |
Initializes a ranking module.
Definition at line 66 of file RankingModule.h.
| virtual ogdf::RankingModule::~RankingModule | ( | ) | [inline, virtual] |
Definition at line 68 of file RankingModule.h.
| virtual void ogdf::RankingModule::call | ( | const Graph & | G, |
| NodeArray< int > & | rank | ||
| ) | [pure virtual] |
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::LongestPathRanking, ogdf::OptimalRanking, and ogdf::CoffmanGrahamRanking.
| virtual void ogdf::RankingModule::call | ( | const Graph & | G, |
| const EdgeArray< int > & | , | ||
| const EdgeArray< int > & | , | ||
| NodeArray< int > & | rank | ||
| ) | [inline, virtual] |
Reimplemented in ogdf::OptimalRanking.
Definition at line 81 of file RankingModule.h.
Computes a node ranking of the digraph G in rank.
| G | is the input digraph. |
| rank | is assigned the node ranking. |
Definition at line 92 of file RankingModule.h.
