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