|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
The namespace for all OGDF objects.
virtual Module::ReturnType doCall(const Graph &graph, const List< edge > &preferredEdges, List< edge > &delEdges, const EdgeArray< TCost > *pCost, bool preferedImplyPlanar) override
Computes the set of edges delEdges which have to be deleted to obtain the planar subgraph.
Interface for planar subgraph algorithms.
Includes declaration of graph class.
@ Feasible
The solution is feasible.
void allEdges(CONTAINER &edgeContainer) const
Returns a container with all edges of the graph.
Declaration of interface for planar subgraph algorithms.
Data type for general directed graphs (adjacency list representation).
Dummy implementation for maximum planar subgraph that returns an empty graph.
Declares base class for all module types.
virtual PlanarSubgraphEmpty * clone() const override
Returns a new instance of the planar subgraph module with the same option settings.
ReturnType
The return type of a module.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.