71 m_useCost = (cost !=
nullptr);
72 m_useForbid = (
forbid !=
nullptr);
Declares base class for all module types.
Declaration of a base class for planar representations of graphs and cluster graphs.
Dynamic arrays indexed with edges.
ReturnType
The return type of a module.
Upward planarized representations (of a connected component) of a graph.
Interface for upward planarization algorithms.
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 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_useForbid
True iff forbidden edges are given.
bool useForbid() const
Returns true iff forbidden edges are given.
virtual ~UpwardPlanarizerModule()
bool m_useCost
True iff edge costs are given.
UpwardPlanarizerModule()
Initializes an upward planarizer module.
virtual ReturnType doCall(UpwardPlanRep &UPR, const EdgeArray< int > &cost, const EdgeArray< bool > &forbid)=0
Computes an upward planarized representation of the input graph.
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.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.