| ||||||||||||||||||

tlp::PlanarityTest Class Reference class for testing the planarity of a graph More...
Inheritance diagram for tlp::PlanarityTest:
Collaboration diagram for tlp::PlanarityTest:
## Static Public Member Functions- static bool isPlanar (Graph *graph)
- static bool isPlanarEmbedding (Graph *graph)
- static bool planarEmbedding (Graph *graph)
- static std::list< edge > getObstructionsEdges (Graph *graph)
## Detailed Descriptionclass for testing the planarity of a graph ## Member Function DocumentationReturns a list of edges that prevents to make the graph planar (ie. part of the minor of K3,3 or K5).
Returns true if the graph is planar (i.e. the graph can be drawn in such a way that no edges cross each other), false otherwise.
Returns true if the current embedding of the graph is planar, false otherwise.
Changes the order of edges around the nodes in order to make the embedding planar (the graph must be planar for that). Returns true if the graph is planar, false otherwise. |

Tulip Software by LaBRI Visualization Team 2001 - 2012 |