Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ogdf::RankingModule Class Referenceabstract

Interface of algorithms for computing a node ranking. More...

#include <ogdf/layered/RankingModule.h>

+ Inheritance diagram for ogdf::RankingModule:

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.
 

Detailed Description

Interface of algorithms for computing a node ranking.

See also
SugiyamaLayout

Definition at line 44 of file RankingModule.h.

Constructor & Destructor Documentation

◆ RankingModule()

ogdf::RankingModule::RankingModule ( )
inline

Initializes a ranking module.

Definition at line 47 of file RankingModule.h.

◆ ~RankingModule()

virtual ogdf::RankingModule::~RankingModule ( )
inlinevirtual

Definition at line 49 of file RankingModule.h.

Member Function Documentation

◆ call() [1/2]

virtual void ogdf::RankingModule::call ( const Graph G,
const EdgeArray< int > &  ,
const EdgeArray< int > &  ,
NodeArray< int > &  rank 
)
inlinevirtual

Reimplemented in ogdf::LongestPathRanking, and ogdf::OptimalRanking.

Definition at line 62 of file RankingModule.h.

◆ call() [2/2]

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.

Parameters
Gis the input digraph.
rankis assigned the node ranking.

Implemented in ogdf::CoffmanGrahamRanking, ogdf::LongestPathRanking, and ogdf::OptimalRanking.

◆ operator()()

void ogdf::RankingModule::operator() ( const Graph G,
NodeArray< int > &  rank 
)
inline

Computes a node ranking of the digraph G in rank.

Parameters
Gis the input digraph.
rankis assigned the node ranking.

Definition at line 73 of file RankingModule.h.


The documentation for this class was generated from the following file: