|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
44 class CrossingStructure;
51 using embedder::CrossingStructure;
167 int& crossingNumber)
override;
184 m_planarization.reset(pPlanarizationModule);
The namespace for all OGDF objects.
Includes declaration of graph class.
Planarized representations (of a connected component) of a graph.
bool m_setTimeout
Helper to insert stars.
Base class for crossing minimization algorithms.
A dual graph including its combinatorial embedding of an embedded graph.
Declaration of CrossingMinimization Module, an interface for crossing minimization algorithms.
Copies of graphs supporting edge splitting.
std::unique_ptr< CrossingMinimizationModule > m_planarization
The initial planarization algorithm.
int64_t m_stopTime
When the algorithm should stop.
void setPlanarization(CrossingMinimizationModule *pPlanarizationModule)
Sets the module option for the computation of the inital planarization.
int maxIterations()
Returns the number of maxIterations.
bool setTimeout()
Returns the current setting of options setTimeout.
void setTimeout(bool b)
Sets the option setTimeout to b.
Includes declaration of dual graph class.
int m_maxIterations
The maximum number of iterations.
void maxIterations(int maxIterations)
Sets the maximum number of iterations.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
The star (re-)insertion approach for crossing minimization.
Declaration of class StarInserter.
ReturnType
The return type of a module.
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.