|
Class Summary |
| AbstractLayout<V,E> |
Implements some of the dirty work of writing a layout algorithm, allowing
the user to express their major intent more simply. |
| FRLayout<V,E> |
Implements the Fruchterman-Reingold algorithm for node layout. |
| ISOMLayout<V,E> |
Implements a self-organizing map layout algorithm, based on Meyer's
self-organizing graph methods. |
| ISOMLayout.ISOMVertexData |
|
| RadiusGraphElementAccessor<V,E> |
Simple implementation of PickSupport that returns the vertex or edge
that is closest to the specified location. |
| RandomLocationTransformer<V> |
Transforms the input type into a random location within
the bounds of the Dimension property. |
| SpringLayout<V,E> |
The SpringLayout package represents a visualization of a set of nodes. |
| SpringLayout.SpringEdgeData<E> |
|
| SpringLayout.SpringVertexData |
|
| SpringLayout.UnitLengthFunction<E> |
Returns all edges as the same length: the input value |