|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
73 : m_runs(runs), m_randomness(randomness), m_rand(rand()) {};
84 void seed(std::minstd_rand rand) { m_rand = rand; }
96 virtual ReturnType doCall(
const Graph& graph,
const List<edge>& preferedEdges,
The namespace for all OGDF objects.
~PlanarSubgraphBoyerMyrvold()
Interface for planar subgraph algorithms.
Includes declaration of graph class.
Booth-Lueker planarity test.
void seed(std::minstd_rand rand)
Seeds the random generator for performing a random DFS. If this method is never called the random gen...
Copies of graphs supporting edge splitting.
bool isRemoved(const GraphCopy ©, const edge e)
Returns true iff this edge could not be embedded.
static void copy(const T &from, T &to)
Declaration of interface for planar subgraph algorithms.
node source() const
Returns the source node of the edge.
Declaration of graph copy classes.
Data type for general directed graphs (adjacency list representation).
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Class for the representation of edges.
Declaration of BoothLueker which implements a planarity test and planar embedding algorithm.
Maximum planar subgraph heuristic based on the Boyer-Myrvold planarity test.
PlanarSubgraphBoyerMyrvold(int runs=1, double randomness=0)
Creates a new Boyer-Myrvold subgraph module.
node target() const
Returns the target node of the edge.
virtual PlanarSubgraphBoyerMyrvold * clone() const override
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.