Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

UpwardPlanarSubgraphModule.h
Go to the documentation of this file.
1 
33 #pragma once
34 
35 #include <ogdf/basic/Graph.h>
36 #include <ogdf/basic/basic.h>
37 #include <ogdf/basic/memory.h>
38 
39 namespace ogdf {
40 class GraphCopy;
41 template<class E>
42 class List;
43 
48 public:
51 
52  // destruction
54 
63  virtual void call(const Graph& G, List<edge>& delEdges) = 0;
64 
66  void operator()(const Graph& G, List<edge>& delEdges) { call(G, delEdges); }
67 
74  void callAndDelete(GraphCopy& GC, List<edge>& delOrigEdges);
75 
77 };
78 
79 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
ogdf::UpwardPlanarSubgraphModule
Interface for algorithms for computing an upward planar subgraph.
Definition: UpwardPlanarSubgraphModule.h:47
Graph.h
Includes declaration of graph class.
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:391
ogdf::UpwardPlanarSubgraphModule::~UpwardPlanarSubgraphModule
virtual ~UpwardPlanarSubgraphModule()
Definition: UpwardPlanarSubgraphModule.h:53
ogdf::UpwardPlanarSubgraphModule::operator()
void operator()(const Graph &G, List< edge > &delEdges)
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
Definition: UpwardPlanarSubgraphModule.h:66
OGDF_MALLOC_NEW_DELETE
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition: memory.h:92
ogdf::List< edge >
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
basic.h
Basic declarations, included by all source files.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::UpwardPlanarSubgraphModule::UpwardPlanarSubgraphModule
UpwardPlanarSubgraphModule()
Initializes an upward planar subgraph module.
Definition: UpwardPlanarSubgraphModule.h:50
memory.h
Declaration of memory manager for allocating small pieces of memory.