|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
68 int& nCrossings)
override {
70 return reduceCrossings(sugi, constH, nCrossings);
94 virtual void call(
Level& L) = 0;
108 class CrossMinMaster;
109 class CrossMinWorker;
The namespace for all OGDF objects.
Declaration of HierarchyLevels class.
Representation of proper hierarchies used by Sugiyama-layout.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Declaration of interface for two-layer crossing minimization algorithms.
virtual ~LayerByLayerSweep()
LayerByLayerSweep()
Initializes a two-layer crossing minimization module.
Sugiyama's layout algorithm.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
virtual void init(const HierarchyLevels &levels)
Initializes the crossing minimization module for hierarchy levels levels.
virtual const HierarchyLevels * reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings) override
Template method implementation of reduceCrossings from LayeredCrossMinModule.
Representation of levels in hierarchies.
Interface of crossing minimization algorithms for layered graphs.
Interface of two-layer crossing minimization algorithms.
void operator()(Level &L)
Performs crossing minimization for level L.
virtual void cleanup() override
Performs clean-up.
Declaration of memory manager for allocating small pieces of memory.
Representation of proper hierarchies used by Sugiyama-layout.