The grid sifting heuristic for crossing minimization. More...
#include <ogdf/layered/GridSifting.h>
Public Member Functions | |
const HierarchyLevelsBase * | reduceCrossings (const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings) override |
Calls the actual crossing minimization algorithm. | |
int | verticalStepsBound () |
Returns the current setting of option verticalStepsBound. | |
void | verticalStepsBound (int b) |
Sets the option verticalStepsBound to b . | |
Public Member Functions inherited from ogdf::LayeredCrossMinModule | |
LayeredCrossMinModule () | |
Creates empty module. | |
virtual | ~LayeredCrossMinModule () |
Destruct. | |
virtual void | cleanup () |
Performs clean-up. | |
Private Attributes | |
int | m_verticalStepsBound = 10 |
The grid sifting heuristic for crossing minimization.
Implementation of the grid sifting heuristic based on C. Bachmaier, W. Brunner, A. Gleißner, Grid Sifting: Leveling and Crossing Reduction, Technical Report MIP-1103, University of Passau, 2011.
This class implements the interface LayeredCrossMinModule and should be used as a part of the Sugiyama algorithm for drawing layered graphs.
Definition at line 95 of file GridSifting.h.
|
inlineoverridevirtual |
Calls the actual crossing minimization algorithm.
nCrossings
is not set by this implementation! Implements ogdf::LayeredCrossMinModule.
Definition at line 102 of file GridSifting.h.
|
inline |
Returns the current setting of option verticalStepsBound.
This option determines, how many levels can be traversed in vertical step of the grid sifting algorithm.
Definition at line 117 of file GridSifting.h.
Sets the option verticalStepsBound to b
.
Definition at line 120 of file GridSifting.h.
|
private |
Definition at line 123 of file GridSifting.h.