|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
39 class CrossingsMatrix;
40 class HierarchyLevels;
62 virtual void call(
Level& L)
override;
65 virtual void cleanup()
override;
The namespace for all OGDF objects.
Includes declaration of graph class.
Implements crossings matrix which is used by some TwoLayerCrossingMinimization heuristics (e....
CrossingsMatrix * m_crossingMatrix
GreedyInsertHeuristic(const GreedyInsertHeuristic &crossMin)
Creates a new instance of the greedy-insert heuristic.
virtual LayerByLayerSweep * clone() const override
Returns a new instance of the greed-insert heuristic with the same option settings.
The greedy-insert heuristic for 2-layer crossing minimization.
GreedyInsertHeuristic()
Creates a new instance of the greedy-insert heuristic.
Declaration of interface for two-layer crossing minimization algorithms.
RegisteredArray for nodes, edges and adjEntries of a graph.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Representation of levels in hierarchies.
Interface of two-layer crossing minimization algorithms.
Representation of proper hierarchies used by Sugiyama-layout.
NodeArray< double > m_weight