Declaration of interface for upward planar subgraph algorithms.
Copies of graphs supporting edge splitting.
Copies of graphs with mapping between nodes and edges.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
Singly linked lists (maintaining the length of the list).
Tuples of two elements (2-tuples).
Interface for algorithms for computing an upward planar subgraph.
A maximal planar subgraph algorithm using planarity testing.
void dfsBuildSpanningTree(node v, SListPure< edge > &treeEdges, NodeArray< bool > &visited)
virtual void call(const Graph &G, List< edge > &delEdges) override
Computes set of edges delEdges which have to be deleted to obtain the upward planar subgraph.
~UpwardPlanarSubgraphSimple()
UpwardPlanarSubgraphSimple()
void call(GraphCopy &GC, List< edge > &delEdges)
bool checkAcyclic(GraphCopySimple &graphAcyclicTest, SList< Tuple2< node, node > > &tmpAugmented)
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
Declaration and implementation of class Tuple2, Tuple3 and Tuple4.