Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

UpwardPlanarity.h
Go to the documentation of this file.
1 
40 #pragma once
41 
43 #include <ogdf/basic/Graph.h>
44 #include <ogdf/basic/basic.h>
45 
46 namespace ogdf {
47 template<class E>
48 class List;
49 template<class E>
50 class SList;
51 
53 
76 public:
80 
83 
87  static bool isUpwardPlanar(Graph& G);
88 
90 
95  static bool embedUpwardPlanar(Graph& G, adjEntry& externalToItsRight);
96 
97 #if 0
98 
104  static int maximalFeasibleUpwardPlanarSubgraph(const Graph &G, GraphCopy &GC);
105 #endif
106 
108 
111 
114 
120  static bool isUpwardPlanar_embedded(const Graph& G);
121 
123  static bool isUpwardPlanar_embedded(const Graph& G, List<adjEntry>& possibleExternalFaces);
124 
126 
129 
132 
138  static bool isUpwardPlanar_triconnected(const Graph& G);
139 
141 
147  static bool upwardPlanarEmbed_triconnected(Graph& G);
148 
149 
151 
154 
157 
163  static bool isUpwardPlanar_singleSource(const Graph& G);
164 
166 
172  static bool upwardPlanarEmbed_singleSource(Graph& G);
173 
175 
184  static bool upwardPlanarAugment_singleSource(Graph& G);
185 
187 
198  static bool upwardPlanarAugment_singleSource(Graph& G, node& superSink,
199  SList<edge>& augmentedEdges);
200 
201 
203 
208  static bool isUpwardPlanar_singleSource_embedded(const ConstCombinatorialEmbedding& E,
209  SList<face>& externalFaces);
210 
212 
219  static bool upwardPlanarAugment_singleSource_embedded(Graph& G, node& superSink,
220  SList<edge>& augmentedEdges);
221 
223 };
224 
225 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
Graph.h
Includes declaration of graph class.
ogdf::SList
Singly linked lists (maintaining the length of the list).
Definition: SList.h:845
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:391
ogdf::AdjElement
Class for adjacency list elements.
Definition: Graph_d.h:142
ogdf::UpwardPlanarity
Upward planarity testing and embedding.
Definition: UpwardPlanarity.h:75
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: DfsMakeBiconnected.h:40
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:869
ogdf::ConstCombinatorialEmbedding
Combinatorial embeddings of planar graphs.
Definition: CombinatorialEmbedding.h:216
basic.h
Basic declarations, included by all source files.
CombinatorialEmbedding.h
Declaration of CombinatorialEmbedding and face.
OGDF_EXPORT
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition: config.h:101
ogdf::NodeElement
Class for the representation of nodes.
Definition: Graph_d.h:240