Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GridSifting.h
Go to the documentation of this file.
1
32#pragma once
33
37
38namespace ogdf {
39class Hierarchy;
40class HierarchyLevelsBase;
41
55public:
63 int nRepeats() { return m_nRepeats; }
64
66 void nRepeats(int num) { m_nRepeats = num; }
67
70 int& nCrossings) {
71 BlockOrder* pBlockOrder = new BlockOrder(H, true);
72 pBlockOrder->globalSifting(sugi.runs(), m_nRepeats, &nCrossings);
73
74 return pBlockOrder;
75 }
76
77private:
78 int m_nRepeats = 10;
79};
80
95public:
102 int& nCrossings) override {
103 BlockOrder* pBlockOrder = new BlockOrder(H, false);
105 pBlockOrder->gridSifting(sugi.runs());
106
107 return pBlockOrder;
108 }
109
117
120
121private:
123};
124
125}
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.
Definition BlockOrder.h:120
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.
Definition GridSifting.h:54
void nRepeats(int num)
Sets the option nRepeats to num.
Definition GridSifting.h:66
const HierarchyLevelsBase * reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings)
Implementation of interface LateredCrossMinModule.
Definition GridSifting.h:69
int nRepeats()
Returns the current setting of option nRepeats.
Definition GridSifting.h:63
The grid sifting heuristic for crossing minimization.
Definition GridSifting.h:94
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.
Definition Hierarchy.h:47
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.