Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
PlanarSubgraphEmpty.h
Go to the documentation of this file.
1
33#pragma once
34
36
37namespace ogdf {
38
40
43template<typename TCost>
45public:
46 virtual PlanarSubgraphEmpty* clone() const override { return new PlanarSubgraphEmpty(); }
47
49 List<edge>& delEdges, const EdgeArray<TCost>* pCost, bool preferedImplyPlanar) override {
50 graph.allEdges(delEdges);
52 }
53};
54}
Declaration of interface for planar subgraph algorithms.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
void allEdges(CONTAINER &edgeContainer) const
Returns a container with all edges of the graph.
Definition Graph_d.h:695
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
ReturnType
The return type of a module.
Definition Module.h:50
@ 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.