20 #ifndef TULIP_PLANARITYTESTX_H
21 #define TULIP_PLANARITYTESTX_H
24 #include <tulip/tulipconf.h>
performs tests to check whether a graph is planar. From wikipedia: "A planar graph is a graph that ca...
static bool planarEmbedding(Graph *graph)
Makes a planar graph a planar embedding, i.e. makes a graph so that no edges cross each other if it i...
static bool isPlanarEmbedding(const Graph *graph)
Checks if the graph is plane (or a planar embedding). A planar graph can be drawn such as no edges cr...
static bool isPlanar(Graph *graph)
Checks whether the graph is planar (i.e. the graph can be drawn on the plane in such a way that no ed...
static std::list< edge > getObstructionsEdges(Graph *graph)
Computes a list of edges that prevent the graph from being planar (i.e. part of the minor of K3,...