61 return doCall(UPR, origEdges,
nullptr,
nullptr);
75 return doCall(UPR, origEdges, &costOrig,
nullptr);
91 return doCall(UPR, origEdges, &costOrig, &forbidOriginal);
108 return doCall(UPR, origEdges,
nullptr, &forbidOriginal);
Includes declaration of graph class.
Declares base class for all module types.
Basic declarations, included by all source files.
Doubly linked lists (maintaining the length of the list).
ReturnType
The return type of a module.
virtual ReturnType doCall(UpwardPlanRep &UPR, const List< edge > &origEdges, const EdgeArray< int > *costOrig, const EdgeArray< bool > *forbiddenEdgeOrig)=0
Actual algorithm call that has to be implemented by derived classes.
ReturnType call(UpwardPlanRep &UPR, const List< edge > &origEdges)
Inserts all edges in origEdges into UPR.
ReturnType call(UpwardPlanRep &UPR, const EdgeArray< int > &costOrig, const List< edge > &origEdges)
Inserts all edges in origEdges with given costs into UPR.
UpwardEdgeInserterModule()
Initializes an edge insertion module.
ReturnType call(UpwardPlanRep &UPR, const EdgeArray< int > &costOrig, const EdgeArray< bool > &forbidOriginal, const List< edge > &origEdges)
Inserts all edges in origEdges with given forbidden edges into UPR.
virtual ~UpwardEdgeInserterModule()
ReturnType call(UpwardPlanRep &UPR, const EdgeArray< bool > &forbidOriginal, const List< edge > &origEdges)
Inserts all edges in origEdges with given forbidden edges into UPR.
Upward planarized representations (of a connected component) of a graph.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.