Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

PlanarityModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 #include <ogdf/basic/Graph.h>
35 
36 namespace ogdf {
37 
39 
49 public:
51 
52  virtual ~PlanarityModule() { }
53 
55  virtual bool isPlanar(const Graph& G) = 0;
56 
58 
61  virtual bool isPlanarDestructive(Graph& G) = 0;
62 
64  virtual bool planarEmbed(Graph& G) = 0;
65 
67 
75  virtual bool planarEmbedPlanarGraph(Graph& G) = 0;
76 };
77 
78 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
Graph.h
Includes declaration of graph class.
ogdf::PlanarityModule::isPlanarDestructive
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...
ogdf::PlanarityModule::planarEmbed
virtual bool planarEmbed(Graph &G)=0
Returns true, if G is planar, false otherwise. If true, G contains a planar embedding.
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::PlanarityModule::isPlanar
virtual bool isPlanar(const Graph &G)=0
Returns true, if G is planar, false otherwise.
ogdf::PlanarityModule::~PlanarityModule
virtual ~PlanarityModule()
Definition: PlanarityModule.h:52
ogdf::PlanarityModule::PlanarityModule
PlanarityModule()
Definition: PlanarityModule.h:50
ogdf::PlanarityModule::planarEmbedPlanarGraph
virtual bool planarEmbedPlanarGraph(Graph &G)=0
Constructs a planar embedding of G. G has to be planar!
ogdf::PlanarityModule
Module for planarity testing and planar embeddings.
Definition: PlanarityModule.h:48