Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
LayeredCrossMinModule.h
Go to the documentation of this file.
1
33#pragma once
34
37
38namespace ogdf {
39
40class SugiyamaLayout;
41
55public:
58
61
64 int& nCrossings) = 0;
65
67 virtual void cleanup() { }
68
70};
71
72}
Declaration of interfaces used in Sugiyama framework.
Declaration of Hierarchy class.
Representation of proper hierarchies used by Sugiyama-layout.
Definition Hierarchy.h:43
Interface of crossing minimization algorithms for layered graphs.
LayeredCrossMinModule()
Creates empty module.
virtual void cleanup()
Performs clean-up.
virtual const HierarchyLevelsBase * reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H, int &nCrossings)=0
Calls the actual crossing minimization algorithm.
virtual ~LayeredCrossMinModule()
Destruct.
Sugiyama's layout algorithm.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:91
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.