See: Description
| Class | Description |
|---|---|
| PlanarAugmentation<V extends Vertex,E extends Edge<V>> |
Given a connected, but not biconnected planar graph, the algorithm
adds a minimum number of edges to turn it into a biconnected graph
while not ruining the planarity
This implementation is based on Fialko and Mutzel's 5/3 approximation
|
| PlanarAugmentationLabel<V extends Vertex,E extends Edge<V>> |
A bundle of pendants together with its parent
is called a label.
|