Public Member Functions
| ||PlanarityModule ()|
|virtual ||~PlanarityModule ()|
|virtual bool ||isPlanar (const Graph &G)=0|
| ||Returns true, if G is planar, false otherwise. |
|virtual bool ||isPlanarDestructive (Graph &G)=0|
| ||Returns true, if G is planar, false otherwise. In the graph is non-planar, the graph may be arbitrariliy changed after the call. |
|virtual bool ||planarEmbed (Graph &G)=0|
| ||Returns true, if G is planar, false otherwise. If true, G contains a planar embedding. |
|virtual bool ||planarEmbedPlanarGraph (Graph &G)=0|
| ||Constructs a planar embedding of G. G has to be planar! |
Module for planarity testing and planar embeddings.
This is a module defining functions to test planarity of graphs, and to embed planar graphs (i.e., find a rotation scheme of the edges around their incident vertices defining a plane graph).
Use this module only if you want to be able to (later on) decide which planarity test to use. If you simply want to test planarity or to embed a graph, use the simpler/preferred method: the direct function calls in extended_graph_alg.h (ogdf::isPlanar, ogdf::planarEmbed, ogdf::planarEmbedPlanarGraph), which use the most efficient BoyerMyrvold algorithm.
Definition at line 65 of file PlanarityModule.h.
|virtual bool ogdf::PlanarityModule::planarEmbedPlanarGraph
Constructs a planar embedding of G. G has to be planar!
Returns true if the embedding was successful. Returns false, if the given graph was non-planar (and leaves the graph in an at least partially deleted state)
This routine may be slightly faster than planarEmbed, but requires G to be planar. If G is not planar, the graph will be (partially) destroyed while trying to embed it!
Implemented in ogdf::BoyerMyrvold, and ogdf::BoothLueker.