|
|||
|
|
|
|||
|
|
The global sifting heuristic for crossing minimization. More...
#include <ogdf/layered/GridSifting.h>
Inheritance diagram for ogdf::GlobalSifting:Public Member Functions | |
| int | nRepeats () |
| Returns the current setting of option nRepeats. More... | |
| void | nRepeats (int num) |
Sets the option nRepeats to num. More... | |
| const HierarchyLevelsBase * | reduceCrossings (const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings) |
| Implementation of interface LateredCrossMinModule. More... | |
| Public Member Functions inherited from ogdf::LayeredCrossMinModule | |
| LayeredCrossMinModule () | |
| Creates empty module. More... | |
| virtual | ~LayeredCrossMinModule () |
| Destruct. More... | |
| virtual void | cleanup () |
| Performs clean-up. More... | |
Private Attributes | |
| int | m_nRepeats = 10 |
The global sifting heuristic for crossing minimization.
Implementation of the global sifting heuristic based on C. Bachmaier, F. J. Brandenburg, W. Brunner, F. Hübner, Global k-Level Crossing Reduction, J. Graph Algorithms and Appl. 15(5), 2011, pp. 631-659. This class implements the interface LayeredCrossMinModule and should be used as a part of the Sugiyama algorithm for drawing layered graphs.
Definition at line 54 of file GridSifting.h.
|
inline |
Returns the current setting of option nRepeats.
This option determines, how many times the global sifting is repeated. Each repetition starts from permutation returned by the previous one. The first repetition starts from random permutation.
Definition at line 63 of file GridSifting.h.
|
inline |
Sets the option nRepeats to num.
Definition at line 66 of file GridSifting.h.
|
inlinevirtual |
Implementation of interface LateredCrossMinModule.
Implements ogdf::LayeredCrossMinModule.
Definition at line 69 of file GridSifting.h.
|
private |
Definition at line 78 of file GridSifting.h.
