Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
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
39namespace ogdf {
40class GraphCopy;
41template<class E>
42class List;
43
48public:
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}
Includes declaration of graph class.
Basic declarations, included by all source files.
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:390
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Doubly linked lists (maintaining the length of the list).
Definition List.h:1451
Interface for algorithms for computing an upward planar subgraph.
void callAndDelete(GraphCopy &GC, List< edge > &delOrigEdges)
Makes GC upward planar by deleting edges.
UpwardPlanarSubgraphModule()
Initializes an upward planar subgraph module.
void operator()(const Graph &G, List< edge > &delEdges)
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
virtual void call(const Graph &G, List< edge > &delEdges)=0
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
Definition memory.h:92
Declaration of memory manager for allocating small pieces of memory.
The namespace for all OGDF objects.