|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
74 m_useCost = (cost !=
nullptr);
75 m_useForbid = (forbid !=
nullptr);
99 return call(UPR, cost, forbid);
The namespace for all OGDF objects.
Includes declaration of graph class.
Declaration of a base class for planar representations of graphs and cluster graphs.
UpwardPlanarizerModule()
Initializes an upward planarizer module.
ReturnType operator()(UpwardPlanRep &UPR, const EdgeArray< int > *cost=nullptr, const EdgeArray< bool > *forbid=nullptr)
Computes a upward planarized representation of the input graph (shorthand for call)
bool m_useCost
True iff edge costs are given.
bool m_useForbid
True iff forbidden edges are given.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
virtual ~UpwardPlanarizerModule()
Basic declarations, included by all source files.
bool useCost() const
Returns true iff edge costs are given.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Interface for upward planarization algorithms.
bool useForbid() const
Returns true iff forbidden edges are given.
Upward planarized representations (of a connected component) of a graph.
Declares base class for all module types.
ReturnType call(UpwardPlanRep &UPR, const EdgeArray< int > *cost=nullptr, const EdgeArray< bool > *forbid=nullptr)
Computes a upward planarized representation (UPR) of the input graph G.
ReturnType
The return type of a module.
Declaration of memory manager for allocating small pieces of memory.
const Graph & original() const
Returns a reference to the original graph.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.