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