72 return doCall(pr, origEdges,
nullptr,
nullptr,
nullptr);
85 return doCall(pr, origEdges, &costOrig,
nullptr,
nullptr);
100 return doCall(pr, origEdges, &costOrig,
nullptr, &edgeSubGraphs);
115 return doCall(pr, origEdges,
nullptr, &forbiddenOrig,
nullptr);
132 return doCall(pr, origEdges, &costOrig, &forbiddenOrig,
nullptr);
151 return doCall(pr, origEdges, &costOrig, &forbiddenOrig, &edgeSubGraphs);
171 return doCall(pr, origEdges, pCostOrig, pForbiddenOrig, pEdgeSubGraphs);
Declaration and implementation of Array class and Array algorithms.
Includes declaration of graph class.
Declares base class for all module types.
Declares base class for modules with timeout functionality.
Basic declarations, included by all source files.
The parameterized class Array implements dynamic arrays of type E.
Interface for edge insertion algorithms.
EdgeInsertionModule(const EdgeInsertionModule &eim)
Initializes an edge insertion module (copy constructor).
ReturnType call(PlanRepLight &pr, const EdgeArray< int > &costOrig, const EdgeArray< bool > &forbiddenOrig, const Array< edge > &origEdges, const EdgeArray< uint32_t > &edgeSubGraphs)
Inserts all edges in origEdges with given costs, forbidden edges, and subgraphs (for simultaneous dra...
ReturnType callEx(PlanRepLight &pr, const Array< edge > &origEdges, const EdgeArray< int > *pCostOrig=nullptr, const EdgeArray< bool > *pForbiddenOrig=nullptr, const EdgeArray< uint32_t > *pEdgeSubGraphs=nullptr)
Inserts all edges in origEdges into pr, optionally costs, forbidden edges, and subgraphs (for simulta...
ReturnType call(PlanRepLight &pr, const EdgeArray< int > &costOrig, const Array< edge > &origEdges, const EdgeArray< uint32_t > &edgeSubGraphs)
Inserts all edges in origEdges with given costs and subgraphs (for simultaneous drawing) into pr.
ReturnType call(PlanRepLight &pr, const Array< edge > &origEdges)
Inserts all edges in origEdges into pr.
virtual ReturnType doCall(PlanRepLight &pr, const Array< edge > &origEdges, const EdgeArray< int > *pCostOrig, const EdgeArray< bool > *pForbiddenOrig, const EdgeArray< uint32_t > *pEdgeSubGraphs)=0
Actual algorithm call that has to be implemented by derived classes.
virtual EdgeInsertionModule * clone() const =0
Returns a new instance of the edge insertion module with the same option settings.
EdgeInsertionModule()
Initializes an edge insertion module (default constructor).
ReturnType call(PlanRepLight &pr, const EdgeArray< int > &costOrig, const EdgeArray< bool > &forbiddenOrig, const Array< edge > &origEdges)
Inserts all edges in origEdges with given costs and forbidden edges into pr.
ReturnType call(PlanRepLight &pr, const EdgeArray< bool > &forbiddenOrig, const Array< edge > &origEdges)
Inserts all edges in origEdges with given forbidden edges into pr.
virtual ~EdgeInsertionModule()
Destructor.
ReturnType call(PlanRepLight &pr, const EdgeArray< int > &costOrig, const Array< edge > &origEdges)
Inserts all edges in origEdges with given costs into pr.
ReturnType
The return type of a module.
Light-weight version of a planarized representation, associated with a PlanRep.
class for timeout funtionality.
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.