Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
CPlanarSubgraphModule.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Module.h>
37
38namespace ogdf {
39
41class CPlanarSubgraphModule : public Module, public Timeouter {
42public:
45
48
58 ReturnType call(const ClusterGraph& G, List<edge>& delEdges) {
59 return call(G, nullptr, delEdges);
60 }
61
75 return doCall(G, pCost, delEdges);
76 }
77
78
79protected:
93 List<edge>& delEdges) = 0;
94
96};
97
98}
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Declares base class for all module types.
Declares base class for modules with timeout functionality.
Interface of algorithms for the computation of c-planar subgraphs.
virtual ReturnType doCall(const ClusterGraph &CG, const EdgeArray< double > *pCost, List< edge > &delEdges)=0
Computes a c-planar subgraph.
ReturnType call(const ClusterGraph &G, List< edge > &delEdges)
Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph.
CPlanarSubgraphModule()
Constructs a cplanar subgraph module.
virtual ~CPlanarSubgraphModule()
Destruction.
ReturnType call(const ClusterGraph &G, const EdgeArray< double > *pCost, List< edge > &delEdges)
Computes set of edges delEdges, which have to be deleted in order to get a c-planar subgraph.
Representation of clustered graphs.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Base class for modules.
Definition Module.h:47
ReturnType
The return type of a module.
Definition Module.h:50
class for timeout funtionality.
Definition Timeouter.h:46
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:91
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.