Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
PlanarityModule.h
Go to the documentation of this file.
1
32#pragma once
33
34namespace ogdf {
35class Graph;
36
38
48public:
50
51 virtual ~PlanarityModule() { }
52
54 virtual bool isPlanar(const Graph& G) = 0;
55
57
60 virtual bool isPlanarDestructive(Graph& G) = 0;
61
63 virtual bool planarEmbed(Graph& G) = 0;
64
66
74 virtual bool planarEmbedPlanarGraph(Graph& G) = 0;
75};
76
77}
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Module for planarity testing and planar embeddings.
virtual bool planarEmbedPlanarGraph(Graph &G)=0
Constructs a planar embedding of G. G has to be planar!
virtual bool isPlanar(const Graph &G)=0
Returns true, if G is planar, false otherwise.
virtual bool planarEmbed(Graph &G)=0
Returns true, if G is planar, false otherwise. If true, G contains a planar embedding.
virtual bool isPlanarDestructive(Graph &G)=0
Returns true, if G is planar, false otherwise. In the graph is non-planar, the graph may be arbitrari...
The namespace for all OGDF objects.