Planar

Algorithms

The following algorithms are available:

jgrapht.algorithms.planar.boyer_myrvold(graph)

The Boyer-Myrvold planarity testing algorithm.

Parameters

graph – the graph

Returns

a tuple whose first element is whether the graph is planar. The second is either an embedding (PlanarEmbedding) or a Kuratowski subgraph.

jgrapht.algorithms.planar.is_planar(graph)

The Boyer-Myrvold planarity testing algorithm.

Parameters

graph – the graph

Returns

a tuple whose first element is whether the graph is planar. The second is either an embedding (PlanarEmbedding) or a Kuratowski subgraph.

Types

Combinatorial embeddings are represented using instances of the following class.

class jgrapht.types.PlanarEmbedding

A planar embedding. Represented as the edges ordered clockwise around the vertices.

abstract edges_around(vertex)

Get edges around a vertex in clockwise order.