|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
41 class PlanRepExpansion;
74 return doCall(PG, cc, forbid, crossingNumber, m_nodeSplits, m_splittedNodes);
100 ReturnType call(
const Graph& G,
const List<node>& splittableNodes,
int& cr,
127 int& crossingNumber,
int& numNS,
int& numSN) = 0;
The namespace for all OGDF objects.
int m_nodeSplits
The number of required node splits.
Includes declaration of graph class.
int numberOfSplittedNodes() const
Planarized representations (of a connected component) of a graph.
Interface for minor-monotone crossing minimization algorithms.
ReturnType call(PlanRepExpansion &PG, int cc, int &crossingNumber, const EdgeArray< bool > *forbid=nullptr)
Computes a planarized representation of an expansion of the input graph.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Doubly linked lists (maintaining the length of the list).
Data type for general directed graphs (adjacency list representation).
int m_splittedNodes
The number of nodes that are split.
MMCrossingMinimizationModule()
Initializes a minor-monotone crossing minimization module.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
int numberOfNodeSplits() const
Returns the number of required node splits after the call.
Declares base class for all module types.
virtual ~MMCrossingMinimizationModule()
ReturnType
The return type of a module.
Declaration of memory manager for allocating small pieces of memory.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.