40class HierarchyLevelsBase;
102 int& nCrossings)
override {
Declaration of BlockOrder and related classes.
Declaration of interface for two-layer crossing minimization algorithms.
Declaration of Sugiyama algorithm.
Hierarchical graph representation used by GlobalSifting and GridSifting algorithms.
void globalSifting(int rho=1, int nRepeats=10, int *pNumCrossings=nullptr)
Calls the global sifting algorithm on graph (its hierarchy).
void gridSifting(int nRepeats=10)
Calls the grid sifting algorithm on a graph (its hierarchy).
The global sifting heuristic for crossing minimization.
void nRepeats(int num)
Sets the option nRepeats to num.
const HierarchyLevelsBase * reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings)
Implementation of interface LateredCrossMinModule.
int nRepeats()
Returns the current setting of option nRepeats.
The grid sifting heuristic for crossing minimization.
const HierarchyLevelsBase * reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings) override
Calls the actual crossing minimization algorithm.
void verticalStepsBound(int b)
Sets the option verticalStepsBound to b.
int verticalStepsBound()
Returns the current setting of option verticalStepsBound.
Representation of proper hierarchies used by Sugiyama-layout.
Interface of crossing minimization algorithms for layered graphs.
Sugiyama's layout algorithm.
int runs() const
Returns the current setting of option runs.
The namespace for all OGDF objects.