Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

PlanarityModule.h
Go to the documentation of this file.
1 
32 #pragma once
33 
34 namespace ogdf {
35 class Graph;
36 
38 
48 public:
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 }
ogdf
The namespace for all OGDF objects.
Definition: multilevelmixer.cpp:39
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::gml::Key::Graph
@ Graph
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:869
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:51
ogdf::PlanarityModule::PlanarityModule
PlanarityModule()
Definition: PlanarityModule.h:49
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:47