73 : m_runs(runs), m_randomness(randomness), m_rand(rand()) {};
84 void seed(std::minstd_rand rand) { m_rand = rand; }
Declaration of BoothLueker which implements a planarity test and planar embedding algorithm.
Includes declaration of graph class.
Declaration of graph copy classes.
Declaration of interface for planar subgraph algorithms.
Basic declarations, included by all source files.
Booth-Lueker planarity test.
Class for the representation of edges.
node target() const
Returns the target node of the edge.
node source() const
Returns the source node of the edge.
Copies of graphs supporting edge splitting.
edge copy(edge e) const override
Returns the first edge in the list of edges corresponding to edge e.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
ReturnType
The return type of a module.
Maximum planar subgraph heuristic based on the Boyer-Myrvold planarity test.
~PlanarSubgraphBoyerMyrvold()
virtual ReturnType doCall(const Graph &graph, const List< edge > &preferedEdges, List< edge > &delEdges, const EdgeArray< int > *pCost, bool preferedImplyPlanar) override
Constructs a planar subgraph according to the options supplied to the constructor.
bool isRemoved(const GraphCopy ©, const edge e)
Returns true iff this edge could not be embedded.
void seed(std::minstd_rand rand)
Seeds the random generator for performing a random DFS. If this method is never called the random gen...
virtual PlanarSubgraphBoyerMyrvold * clone() const override
Returns a new instance of the planar subgraph module with the same option settings.
PlanarSubgraphBoyerMyrvold(int runs=1, double randomness=0)
Creates a new Boyer-Myrvold subgraph module.
Interface for planar subgraph algorithms.
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),...
The namespace for all OGDF objects.