| Package | Description |
|---|---|
| graph.algorithms.planarity |
Implementations of different planarity testing algorithms.
|
| Modifier and Type | Class and Description |
|---|---|
class |
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.
|
class |
FraysseixMendezPlanarity<V extends Vertex,E extends Edge<V>>
An algorithm for checking the planarity of a graph based on Fraysseix and Mendez's algorithm
|
class |
PQTreePlanarity<V extends Vertex,E extends Edge<V>>
Implementation of the PQ tree planarity testing based on Booth and Lueker's algorithm
|