| Class | Description |
|---|---|
| PQTree<V extends Vertex,E extends Edge<V>> |
Class represents a PQ-tree, which is used in some algorithms for planarity testing
P nodes are cut vertices
Q nodes are nonseparable components
Leaves are virtual vertices (vertices on the other side of edges where one vertex is on subgraph Gk and the
other one is in V-Vk)
|
| PQTreeEdge |
Edge of the PQ-tree
|
| PQTreeNode |
Node of the PQ-tree
|
| PQTreeReduction<V extends Vertex,E extends Edge<V>> |
Implementation of the PQ-tree reduction procedure, as described by Booth and Lueker.
|
| Enum | Description |
|---|---|
| PQNodeLabel |
Possible labels of PQ-nodes
|
| PQNodeMark |
A list of PQ-node marks
|
| PQNodeOrderValid |
Validity of PQ-nodes (valid, invalid or needs to be reversed)
|
| PQNodeType |
Types of PQ-nodes
|