42template<
class E1,
class E2>
Includes declaration of graph class.
Declaration of interface for upward planar subgraph algorithms.
Basic declarations, included by all source files.
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).
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)
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.