Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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