See: Description
Interface | Description |
---|---|
Arrangement<N> |
Interface for general arrangements.
|
GraphArrangement<N,E> |
Interface for all graph arrangements supported by this package.
|
GridArrangement<C> |
Interface for all grid arrangements supported by this package.
|
TreeArrangement<N> |
Interface for all tree arrangements supported by this package.
|
Class | Description |
---|---|
AbstractArrangement<N> |
Abstract class for arrangements of nodes.
|
CircleArrangement<N,E> |
Arrangement class which will arrange all nodes in a circle with a radius
close to the size of the working area.
|
ClusterArrangement<N,E> |
The ClusterArrangement separates graphs into separate clusters.
|
DiagonalArrangement<N,E> |
Arranges the nodes in a diagonal arrangement.
|
DirectedArrangement<N,E> |
Arrangement class which will arrange all nodes in a directed fashion,
similar to a tree, but with multiple possible roots.
|
FocusArrangement<N> |
Arrangement interface for those arrangements which focus on a particular
node.
|
OrthoTreeArrangement<N> |
Arrangement class which will arrange the nodes in a hierarchical layout.
|
RandomArrangement<N,E> |
Arrangement class which will arrange all nodes in random locations within
the working area.
|
RectangularArrangement<N,E> |
Arranges the nodes of a graph or grid in a rectangular style.
|
TargetArrangement<N,E> |
Arrangement class which will arrange all nodes in a radial pattern with the
designated target node in the center.
|
TierArrangement<N,E> |
Arrangement class which will arrange the nodes in a hierarchical layout.
|
Exception | Description |
---|---|
ArrangementException |
Signals that an Arrangement error has occurred.
|
Contains classes and interfaces used to arrange various data structures, giving them particular layouts.