Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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 
38 namespace ogdf {
39 
40 class Hierarchy;
41 class HierarchyLevelsBase;
42 class SugiyamaLayout;
43 
57 public:
60 
62  virtual ~LayeredCrossMinModule() { }
63 
65  virtual const HierarchyLevelsBase* reduceCrossings(const SugiyamaLayout& sugi, Hierarchy& H,
66  int& nCrossings) = 0;
67 
69  virtual void cleanup() { }
70 
72 };
73 
74 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
ogdf::Hierarchy
Representation of proper hierarchies used by Sugiyama-layout.
Definition: Hierarchy.h:47
ogdf::HierarchyLevelsBase
Definition: CrossingMinInterfaces.h:63
ogdf::LayeredCrossMinModule::~LayeredCrossMinModule
virtual ~LayeredCrossMinModule()
Destruct.
Definition: LayeredCrossMinModule.h:62
OGDF_MALLOC_NEW_DELETE
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition: memory.h:92
ogdf::LayeredCrossMinModule::LayeredCrossMinModule
LayeredCrossMinModule()
Creates empty module.
Definition: LayeredCrossMinModule.h:59
ogdf::SugiyamaLayout
Sugiyama's layout algorithm.
Definition: SugiyamaLayout.h:168
basic.h
Basic declarations, included by all source files.
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:69
ogdf::LayeredCrossMinModule
Interface of crossing minimization algorithms for layered graphs.
Definition: LayeredCrossMinModule.h:56
memory.h
Declaration of memory manager for allocating small pieces of memory.