See: Description
| Class | Description |
|---|---|
| Circular<V extends Vertex,E extends Edge<V>> |
An implementation of the algorithm CIRCULAR
which optimizes the number of edge crossings in circular drawings
|
| GraphCopy<V extends Vertex,E extends Edge<V>> |
A graph containing triangulated edges.
|
| TriangulatedEdge<V extends Vertex> |
Triangulated edge as defined in algorithm CIRCULAR
|