class |
AbstractIterativeLayoutAlgorithm<V> |
For Iterative algorithms that perform delayed operations on a Thread, save off the layoutModel so
that it can be accessed by the threaded code.
|
class |
AbstractTreeLayoutAlgorithm<V> |
A base class for tree layout algorithms.
|
class |
BalloonLayoutAlgorithm<V> |
A Layout implementation that assigns positions to Tree or Graph vertices
using associations with nested circles ("balloons").
|
class |
DAGLayoutAlgorithm<V,E> |
An implementation of Layout suitable for tree-like directed acyclic graphs.
|
class |
EdgeAwareTreeLayoutAlgorithm<V,E> |
|
class |
ForceAtlas2LayoutAlgorithm<V> |
Implementation of ForceAtlas2 algorithm.
|
class |
FRLayoutAlgorithm<V> |
Implements the Fruchterman-Reingold force-directed algorithm for vertex layout.
|
class |
GEMLayoutAlgorithm<V,E> |
Java implementation of the gem 2D layout.
|
class |
ISOMLayoutAlgorithm<V> |
Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph
methods.
|
class |
KKLayoutAlgorithm<V> |
Implements the Kamada-Kawai algorithm for vertex layout.
|
class |
MultiRowEdgeAwareTreeLayoutAlgorithm<V,E> |
A Multi-Row TreeLayoutAlgorithm that can be modified with comparators and predicates for
both vertices and edges
|
class |
MultiRowTreeLayoutAlgorithm<V> |
A TreeLayoutAlgorithm that adheres to either an original width or to the width of the
widest subtree in the forest by creating new rows of tree roots
|
class |
RadialEdgeAwareTreeLayoutAlgorithm<V,E> |
A radial layout for Tree or Forest graphs.
|
class |
RadialTreeLayoutAlgorithm<V> |
A radial layout for Tree or Forest graphs.
|
class |
SpringLayoutAlgorithm<V,E> |
The SpringLayout package represents a visualization of a set of vertices.
|
class |
TidierRadialTreeLayoutAlgorithm<V,E> |
A radial layout for Tree or Forest graphs.
|
class |
TidierTreeLayoutAlgorithm<V,E> |
A more compact tree layout algorithm.
|
class |
TreeLayoutAlgorithm<V> |
A simple tree layout algorithm that will allow multiple roots.
|