Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
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
46namespace ogdf {
47
48
50
73public:
78
80
84 static bool isUpwardPlanar(Graph& G);
85
87
93
94#if 0
96
102#endif
103
105
109
111
117 static bool isUpwardPlanar_embedded(const Graph& G);
118
120 static bool isUpwardPlanar_embedded(const Graph& G, List<adjEntry>& possibleExternalFaces);
121
123
127
129
135 static bool isUpwardPlanar_triconnected(const Graph& G);
136
138
145
146
148
152
154
160 static bool isUpwardPlanar_singleSource(const Graph& G);
161
163
170
172
182
184
197
198
200
207
209
218
220};
221
222}
Declaration of CombinatorialEmbedding and face.
Includes declaration of graph class.
Declaration of singly linked lists and iterators.
Class for adjacency list elements.
Definition Graph_d.h:79
Combinatorial embeddings of planar graphs.
Copies of graphs supporting edge splitting.
Definition GraphCopy.h:254
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Doubly linked lists (maintaining the length of the list).
Definition List.h:1435
Class for the representation of nodes.
Definition Graph_d.h:177
Singly linked lists (maintaining the length of the list).
Definition SList.h:833
Upward planarity testing and embedding.
static bool embedUpwardPlanar(Graph &G, adjEntry &externalToItsRight)
Tests whether graph G is upward planar and embeds the graph by a upward planar embedding if possible ...
static bool isUpwardPlanar(Graph &G)
Tests whether graph G is upward planar (using satisfiability).
static bool upwardPlanarAugment_singleSource(Graph &G, node &superSink, SList< edge > &augmentedEdges)
Tests whether single-source digraph G is upward planar, and if yes augments it to a planar st-digraph...
static bool isUpwardPlanar_embedded(const Graph &G, List< adjEntry > &possibleExternalFaces)
Tests whether a biconnected graph G is upward planarly embedded and computes the set of possible exte...
static bool isUpwardPlanar_embedded(const Graph &G)
Tests whether a biconnected graph G is upward planarly embedded.
static bool upwardPlanarEmbed_singleSource(Graph &G)
Upward planarly embeds the single-source digraph G.
static bool isUpwardPlanar_singleSource(const Graph &G)
Tests whether the single-source digraph G is upward planar.
static bool isUpwardPlanar_triconnected(const Graph &G)
Tests whether the triconnected digraph G is upward planar.
static bool upwardPlanarAugment_singleSource(Graph &G)
Tests whether single-source digraph G is upward planar, and if yes augments it to a planar st-digraph...
static bool upwardPlanarAugment_singleSource_embedded(Graph &G, node &superSink, SList< edge > &augmentedEdges)
Tests if single-source digraph G is upward planarly embedded and augments it to a planar st-digraph.
static bool isUpwardPlanar_singleSource_embedded(const ConstCombinatorialEmbedding &E, SList< face > &externalFaces)
Tests whether the embedding E of a single-source digraph is upward planar.
static bool upwardPlanarEmbed_triconnected(Graph &G)
Upward planarly embeds the triconnected digraph G.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.