Interface of crossing minimization algorithms for layered graphs. More...
#include <ogdf/layered/LayeredCrossMinModule.h>
Public Member Functions | |
LayeredCrossMinModule () | |
Creates empty module. More... | |
virtual | ~LayeredCrossMinModule () |
Destruct. More... | |
virtual void | cleanup () |
Performs clean-up. More... | |
virtual const HierarchyLevelsBase * | reduceCrossings (const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings)=0 |
Calls the actual crossing minimization algorithm. More... | |
Interface of crossing minimization algorithms for layered graphs.
The interface of a two-layer crossing minimization algorithm consists of two methods:
Definition at line 56 of file LayeredCrossMinModule.h.
|
inline |
Creates empty module.
Definition at line 59 of file LayeredCrossMinModule.h.
|
inlinevirtual |
Destruct.
Definition at line 62 of file LayeredCrossMinModule.h.
|
inlinevirtual |
Performs clean-up.
Reimplemented in ogdf::LayerByLayerSweep, ogdf::SplitHeuristic, ogdf::SiftingHeuristic, ogdf::BarycenterHeuristic, ogdf::GreedySwitchHeuristic, ogdf::MedianHeuristic, and ogdf::GreedyInsertHeuristic.
Definition at line 69 of file LayeredCrossMinModule.h.
|
pure virtual |
Calls the actual crossing minimization algorithm.
Implemented in ogdf::GridSifting, ogdf::LayerByLayerSweep, and ogdf::GlobalSifting.