41class PlanRepExpansion;
74 return doCall(PG, cc, forbid, crossingNumber, m_nodeSplits, m_splittedNodes);
127 int& crossingNumber,
int& numNS,
int& numSN) = 0;
Includes declaration of graph class.
Declares base class for all module types.
Basic declarations, included by all source files.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
Interface for minor-monotone crossing minimization algorithms.
int numberOfNodeSplits() const
Returns the number of required node splits after the call.
virtual ~MMCrossingMinimizationModule()
ReturnType call(const Graph &G, const List< node > &splittableNodes, int &cr, const EdgeArray< bool > *forbid=nullptr)
Performs minor-monotone crossing minimization on G for given splittable nodes.
int m_splittedNodes
The number of nodes that are split.
int m_nodeSplits
The number of required node splits.
virtual ReturnType doCall(PlanRepExpansion &PG, int cc, const EdgeArray< bool > *forbid, int &crossingNumber, int &numNS, int &numSN)=0
Actual algorithm call that needs to be implemented by derived classed.
ReturnType call(const Graph &G, int &cr, const EdgeArray< bool > *forbid=nullptr)
Performs minor-monotone crossing minimization on G.
MMCrossingMinimizationModule()
Initializes a minor-monotone crossing minimization module.
int numberOfSplittedNodes() const
ReturnType call(PlanRepExpansion &PG, int cc, int &crossingNumber, const EdgeArray< bool > *forbid=nullptr)
Computes a planarized representation of an expansion of the input graph.
ReturnType
The return type of a module.
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.