Declaration of graph copy classes.
Copies of graphs supporting edge splitting.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
Interface for algorithms for computing an upward planar subgraph.
virtual ~UpwardPlanarSubgraphModule()
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 DLL.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
