Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

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 
39 namespace ogdf {
40 class GraphCopy;
41 class GraphCopySimple;
42 template<class E1, class E2>
43 class Tuple2;
44 template<class E>
45 class List;
46 template<class E>
47 class SList;
48 template<class E>
49 class SListPure;
50 
53 public:
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 
68 private:
69  bool checkAcyclic(GraphCopySimple& graphAcyclicTest, SList<Tuple2<node, node>>& tmpAugmented);
70 
71  void dfsBuildSpanningTree(node v, SListPure<edge>& treeEdges, NodeArray<bool>& visited);
72 };
73 
74 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
ogdf::UpwardPlanarSubgraphModule
Interface for algorithms for computing an upward planar subgraph.
Definition: UpwardPlanarSubgraphModule.h:47
Graph.h
Includes declaration of graph class.
ogdf::Tuple2
Tuples of two elements (2-tuples).
Definition: tuples.h:49
ogdf::UpwardPlanarSubgraphSimple
A maximal planar subgraph algorithm using planarity testing.
Definition: UpwardPlanarSubgraphSimple.h:52
ogdf::SList
Singly linked lists (maintaining the length of the list).
Definition: SList.h:845
UpwardPlanarSubgraphModule.h
Declaration of interface for upward planar subgraph algorithms.
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:391
ogdf::GraphCopySimple
Copies of graphs with mapping between nodes and edges.
Definition: GraphCopy.h:261
ogdf::UpwardPlanarSubgraphSimple::~UpwardPlanarSubgraphSimple
~UpwardPlanarSubgraphSimple()
Definition: UpwardPlanarSubgraphSimple.h:58
ogdf::SListPure
Singly linked lists.
Definition: SList.h:52
ogdf::List< edge >
ogdf::internal::GraphRegisteredArray
RegisteredArray for nodes, edges and adjEntries of a graph.
Definition: Graph_d.h:658
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
basic.h
Basic declarations, included by all source files.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::UpwardPlanarSubgraphSimple::UpwardPlanarSubgraphSimple
UpwardPlanarSubgraphSimple()
Definition: UpwardPlanarSubgraphSimple.h:55
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:240