Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
UpwardPlanarSubgraphSimple.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>
38
39namespace ogdf {
40class GraphCopy;
41class GraphCopySimple;
42template<class E1, class E2>
43class Tuple2;
44template<class E>
45class List;
46template<class E>
47class SList;
48template<class E>
49class SListPure;
50
53public:
54 // construction
56
57 // destruction
59
60 // computes set of edges delEdges, which have to be deleted
61 // in order to get a planar subgraph; edges in preferedEdges
62 // should be contained in planar subgraph
63 virtual void call(const Graph& G, List<edge>& delEdges) override;
64
65 void call(GraphCopy& GC, List<edge>& delEdges);
66
67
68private:
69 bool checkAcyclic(GraphCopySimple& graphAcyclicTest, SList<Tuple2<node, node>>& tmpAugmented);
70
72};
73
74}
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.
Definition GraphCopy.h:390
Copies of graphs with mapping between nodes and edges.
Definition GraphCopy.h:260
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
Class for the representation of nodes.
Definition Graph_d.h:241
Singly linked lists (maintaining the length of the list).
Definition SList.h:845
Singly linked lists.
Definition SList.h:191
Tuples of two elements (2-tuples).
Definition tuples.h:49
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.
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.
Definition Graph_d.h:659
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
The namespace for all OGDF objects.