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
35#include <ogdf/basic/basic.h>
36#include <ogdf/basic/memory.h>
37
38namespace ogdf {
39
40class Hierarchy;
41class HierarchyLevelsBase;
42class SugiyamaLayout;
43
57public:
60
63
66 int& nCrossings) = 0;
67
69 virtual void cleanup() { }
70
72};
73
74}
Basic declarations, included by all source files.
Representation of proper hierarchies used by Sugiyama-layout.
Definition Hierarchy.h:47
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 dynamic library (shared object / DLL),...
Definition config.h:117
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:92
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.