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
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
37
38namespace ogdf {
39class CrossingsMatrix;
40class HierarchyLevels;
41class Level;
42
44
48public:
51
54
56 virtual LayerByLayerSweep* clone() const override { return new GreedyInsertHeuristic(*this); }
57
59 virtual void init(const HierarchyLevels& levels) override;
60
62 virtual void call(Level& L) override;
63
65 virtual void cleanup() override;
66
67private:
70};
71
72}
Includes declaration of graph class.
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-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:66
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition Graph_d.h:659
#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.