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/SList.h>
45 
46 namespace ogdf {
47 
48 
50 
73 public:
77 
80 
84  static bool isUpwardPlanar(Graph& G);
85 
87 
92  static bool embedUpwardPlanar(Graph& G, adjEntry& externalToItsRight);
93 
94 #if 0
95 
101  static int maximalFeasibleUpwardPlanarSubgraph(const Graph &G, GraphCopy &GC);
102 #endif
103 
105 
108 
111 
117  static bool isUpwardPlanar_embedded(const Graph& G);
118 
120  static bool isUpwardPlanar_embedded(const Graph& G, List<adjEntry>& possibleExternalFaces);
121 
123 
126 
129 
135  static bool isUpwardPlanar_triconnected(const Graph& G);
136 
138 
144  static bool upwardPlanarEmbed_triconnected(Graph& G);
145 
146 
148 
151 
154 
160  static bool isUpwardPlanar_singleSource(const Graph& G);
161 
163 
169  static bool upwardPlanarEmbed_singleSource(Graph& G);
170 
172 
181  static bool upwardPlanarAugment_singleSource(Graph& G);
182 
184 
195  static bool upwardPlanarAugment_singleSource(Graph& G, node& superSink,
196  SList<edge>& augmentedEdges);
197 
198 
200 
205  static bool isUpwardPlanar_singleSource_embedded(const ConstCombinatorialEmbedding& E,
206  SList<face>& externalFaces);
207 
209 
216  static bool upwardPlanarAugment_singleSource_embedded(Graph& G, node& superSink,
217  SList<edge>& augmentedEdges);
218 
220 };
221 
222 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::SList
Singly linked lists (maintaining the length of the list).
Definition: SList.h:833
ogdf::GraphCopy
Copies of graphs supporting edge splitting.
Definition: GraphCopy.h:384
ogdf::AdjElement
Class for adjacency list elements.
Definition: Graph_d.h:135
ogdf::UpwardPlanarity
Upward planarity testing and embedding.
Definition: UpwardPlanarity.h:72
SList.h
Declaration of singly linked lists and iterators.
ogdf::List
Doubly linked lists (maintaining the length of the list).
Definition: List.h:42
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::ConstCombinatorialEmbedding
Combinatorial embeddings of planar graphs.
Definition: CombinatorialEmbedding.h:207
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:233