See: Description
| Class | Description |
|---|---|
| BoyerMyrvoldPlanarity<V extends Vertex,E extends Edge<V>> |
Implementation of the Boyer-Myrvold planarity testing algorithm
The Boyer-Myrvold algorithm is a planarity testing algorithm which uses reverse DFS order as numbering
of the vertices of G.
|
| Embedding<V extends Vertex,E extends Edge<V>> |
Represents embedding of a graph - clockwise order of edges around each vertex
|
| FraysseixMendezPlanarity<V extends Vertex,E extends Edge<V>> |
An algorithm for checking the planarity of a graph based on Fraysseix and Mendez's algorithm
|
| MaximumPlanaritySubgraph<V extends Vertex,E extends Edge<V>> |
Finds maximum planar subgraph
A widely used standard heuristic for finding a maximal planar subgraph is to start with
a spanning tree of G, and to iteratively try to add the remaining edges one by one
In every step, a planarity testing algorithm is called for the obtained graph.
|
| PlanarEmbedding |
Class containing methods for calculating planar embedding
|
| PlanarFaces<V extends Vertex,E extends Edge<V>> |
Finds planar faces of a graph.
|
| PlanarityTestingAlgorithm<V extends Vertex,E extends Edge<V>> |
A class which should be extended by all planarity testing implementations
|
| PQTreePlanarity<V extends Vertex,E extends Edge<V>> |
Implementation of the PQ tree planarity testing based on Booth and Lueker's algorithm
|