Declaration of MMCrossingMinimization Module, an interface for minor-monotone crossing minimization a...
Declaration of interface for minor-monotone edge insertion algorithms.
Declaration of interface for planar subgraph algorithms.
Dynamic arrays indexed with edges.
Interface for minor-monotone crossing minimization algorithms.
Interface for minor-monotone edge insertion algorithms.
Planarization approach for minor-monotone crossing minimization.
int permutations()
Returns the number of performed permutations in the edge insertion step.
void permutations(int p)
Sets the number of performed permutations in the edge insertion step.
void setSubgraph(PlanarSubgraphModule< int > *pSubgraph)
Sets the module option for the computation of the planar subgraph.
int m_permutations
The number of permutations.
MMSubgraphPlanarizer()
Creates a subgraph planarizer for minor-monotone crossing minimization.
void setInserter(MMEdgeInsertionModule *pInserter)
Sets the module option for minor-monotone edge insertion.
virtual ReturnType doCall(PlanRepExpansion &PG, int cc, const EdgeArray< bool > *forbid, int &crossingNumber, int &numNS, int &numSN) override
Actual algorithm call that needs to be implemented by derived classed.
std::unique_ptr< PlanarSubgraphModule< int > > m_subgraph
The planar subgraph module.
std::unique_ptr< MMEdgeInsertionModule > m_inserter
The minor-monotone edge insertion module.
ReturnType
The return type of a module.
Planarized representations (of a connected component) of a graph.
Interface for planar subgraph algorithms.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.