Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
GreedyInsertHeuristic.h
Go to the documentation of this file.
1
32#pragma once
33
37
38namespace ogdf {
39
41
45public:
48
51
53 virtual LayerByLayerSweep* clone() const override { return new GreedyInsertHeuristic(*this); }
54
56 virtual void init(const HierarchyLevels& levels) override;
57
59 virtual void call(Level& L) override;
60
62 virtual void cleanup() override;
63
64private:
67};
68
69}
Declaration of class CrossingsMatrix.
Declaration of interface for two-layer crossing minimization algorithms.
Declaration and implementation of NodeArray class.
Implements crossings matrix which is used by some TwoLayerCrossingMinimization heuristics (e....
The greedy-insert heuristic for 2-layer crossing minimization.
virtual LayerByLayerSweep * clone() const override
Returns a new instance of the greed-insert heuristic with the same option settings.
virtual void cleanup() override
Does some clean-up after calls.
virtual void call(Level &L) override
Calls the greedy insert heuristic for level L.
GreedyInsertHeuristic()
Creates a new instance of the greedy-insert heuristic.
GreedyInsertHeuristic(const GreedyInsertHeuristic &crossMin)
Creates a new instance of the greedy-insert heuristic.
virtual void init(const HierarchyLevels &levels) override
Initializes weights and crossing minimization for hierarchy H.
Representation of proper hierarchies used by Sugiyama-layout.
Interface of two-layer crossing minimization algorithms.
Representation of levels in hierarchies.
Definition Level.h:60
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.