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
35#include <ogdf/basic/Graph.h>
36#include <ogdf/basic/Module.h>
38
39namespace ogdf {
40template<class E>
41class List;
42
44
47template<typename TCost>
49public:
50 virtual PlanarSubgraphEmpty* clone() const override { return new PlanarSubgraphEmpty(); }
51
52 virtual Module::ReturnType doCall(const Graph& graph, const List<edge>& preferredEdges,
53 List<edge>& delEdges, const EdgeArray<TCost>* pCost, bool preferedImplyPlanar) override {
54 graph.allEdges(delEdges);
56 }
57};
58}
Includes declaration of graph class.
Declares base class for all module types.
Declaration of interface for planar subgraph algorithms.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
void allEdges(CONTAINER &edgeContainer) const
Returns a container with all edges of the graph.
Definition Graph_d.h:1043
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
ReturnType
The return type of a module.
Definition Module.h:52
@ 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.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Definition Graph_d.h:717
The namespace for all OGDF objects.