43template<
typename TCost>
Declaration of interface for planar subgraph algorithms.
Dynamic arrays indexed with edges.
Data type for general directed graphs (adjacency list representation).
void allEdges(CONTAINER &edgeContainer) const
Returns a container with all edges of the graph.
Doubly linked lists (maintaining the length of the list).
ReturnType
The return type of a module.
@ Feasible
The solution is feasible.
Dummy implementation for maximum planar subgraph that returns an empty graph.
virtual PlanarSubgraphEmpty * clone() const override
Returns a new instance of the planar subgraph module with the same option settings.
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.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.