Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GreedySwitchHeuristic.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/basic.h>
37
38namespace ogdf {
39class HierarchyLevels;
40class Level;
41
43
47public:
49 GreedySwitchHeuristic() : m_crossingMatrix(nullptr) { }
50
52 GreedySwitchHeuristic(const GreedySwitchHeuristic& crossMin) : m_crossingMatrix(nullptr) { }
53
54 ~GreedySwitchHeuristic() { delete m_crossingMatrix; }
55
57 virtual LayerByLayerSweep* clone() const override { return new GreedySwitchHeuristic; }
58
60 virtual void init(const HierarchyLevels& levels) override;
61
63 virtual void call(Level& L) override;
64
66 virtual void cleanup() override;
67
68private:
70};
71
72}
Declaration of class CrossingsMatrix.
Declaration of interface for two-layer crossing minimization algorithms.
Basic declarations, included by all source files.
Implements crossings matrix which is used by some TwoLayerCrossingMinimization heuristics (e....
The greedy-switch heuristic for 2-layer crossing minimization.
virtual LayerByLayerSweep * clone() const override
Returns a new instance of the greed-switch heuristic with the same option settings.
GreedySwitchHeuristic(const GreedySwitchHeuristic &crossMin)
Creates a new instance of the greedy-switch heuristic.
virtual void init(const HierarchyLevels &levels) override
Initializes crossing minimization for hierarchy H.
virtual void call(Level &L) override
Calls the greedy switch heuristic for level L.
virtual void cleanup() override
Does some clean-up after calls.
GreedySwitchHeuristic()
Creates a new instance of the greedy-switch heuristic.
Representation of proper hierarchies used by Sugiyama-layout.
Interface of two-layer crossing minimization algorithms.
Representation of levels in hierarchies.
Definition Level.h:66
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
The namespace for all OGDF objects.