|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
43 class PlanRepExpansion;
69 int& crossingNumber,
int& numNS,
int& numSN)
override;
Declaration of interface for minor-monotone edge insertion algorithms.
The namespace for all OGDF objects.
Includes declaration of graph class.
Planarization approach for minor-monotone crossing minimization.
int permutations()
Returns the number of performed permutations in the edge insertion step.
void setInserter(MMEdgeInsertionModule *pInserter)
Sets the module option for minor-monotone edge insertion.
Planarized representations (of a connected component) of a graph.
void permutations(int p)
Sets the number of performed permutations in the edge insertion step.
Interface for minor-monotone crossing minimization algorithms.
Declaration of interface for planar subgraph algorithms.
Interface for minor-monotone edge insertion algorithms.
std::unique_ptr< MMEdgeInsertionModule > m_inserter
The minor-monotone edge insertion module.
std::unique_ptr< PlanarSubgraphModule< int > > m_subgraph
The planar subgraph module.
int m_permutations
The number of permutations.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
void setSubgraph(PlanarSubgraphModule< int > *pSubgraph)
Sets the module option for the computation of the planar subgraph.
Declaration of MMCrossingMinimization Module, an interface for minor-monotone crossing minimization a...
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.