| AbstractHierarchicalMinCrossLayoutAlgorithm |
The Sugiyama Hierarchical Minimum-Cross layout algorithm
|
| AbstractHierarchicalMinCrossLayoutAlgorithm.Builder |
a Builder to create a configured instance
|
| AbstractIterativeLayoutAlgorithm |
For Iterative algorithms that perform delayed operations on a Thread, save off the layoutModel so
that it can be accessed by the threaded code.
|
| AbstractIterativeLayoutAlgorithm.Builder |
|
| AbstractLayoutAlgorithm |
For Layout algorithms that can run an 'after' function
|
| AbstractLayoutAlgorithm.Builder |
|
| AbstractTreeLayoutAlgorithm |
A base class for tree layout algorithms.
|
| AbstractTreeLayoutAlgorithm.Builder |
|
| Balloon |
marker interface used only to signal that the balloon layout paintables might be applied
|
| BalloonLayoutAlgorithm |
A Layout implementation that assigns positions to Tree or Graph vertices
using associations with nested circles ("balloons").
|
| BalloonLayoutAlgorithm.Builder |
|
| CircleLayoutAlgorithm |
A Layout implementation that positions vertices equally spaced on a regular circle.
|
| CircleLayoutAlgorithm.Builder |
|
| DAGLayoutAlgorithm |
An implementation of Layout suitable for tree-like directed acyclic graphs.
|
| DAGLayoutAlgorithm.Builder |
|
| EdgeAwareLayoutAlgorithm |
A marker interface for LayoutAlgorithms that are aware of graph edges and can use the edges as
part of the layout vertex positioning
|
| EdgeAwareLayoutAlgorithm.Builder |
|
| EdgeAwareTreeLayoutAlgorithm |
|
| EdgeAwareTreeLayoutAlgorithm.Builder |
a Builder to create a configured instance of an EdgeAwareTreeLayoutAlgorithm
|
| EdgePredicated |
an interface for LayoutAlgorithm that can set a Predicate to filter edges
|
| EdgeSorting |
an interface for LayoutAlgorithms with a settable Comparator for edges
|
| EiglspergerLayoutAlgorithm |
The Sugiyama Hierarchical Minimum-Cross layout algorithm
|
| EiglspergerLayoutAlgorithm.Builder |
a Builder to create a configured instance
|
| ForceAtlas2LayoutAlgorithm |
Implementation of ForceAtlas2 algorithm.
|
| ForceAtlas2LayoutAlgorithm.Builder |
|
| FRLayoutAlgorithm |
Implements the Fruchterman-Reingold force-directed algorithm for vertex layout.
|
| FRLayoutAlgorithm.Builder |
|
| GEMLayoutAlgorithm |
Java implementation of the gem 2D layout.
|
| GEMLayoutAlgorithm.Builder |
|
| HierarchicalMinCrossLayoutAlgorithm |
A Hierarchical Minimum-Cross layout algorithm based on Sugiyama.
|
| HierarchicalMinCrossLayoutAlgorithm.Builder |
a Builder to create a configured instance
|
| ISOMLayoutAlgorithm |
Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph
methods.
|
| ISOMLayoutAlgorithm.Builder |
|
| IterativeLayoutAlgorithm |
A LayoutAlgorithm that may utilize a pre-relax phase, which is a loop of calls to step
that occurr in the current thread instead of in a new Thread.
|
| KKLayoutAlgorithm |
Implements the Kamada-Kawai algorithm for vertex layout.
|
| KKLayoutAlgorithm.Builder |
|
| KKLayoutAlgorithm.Pair |
|
| Layered |
|
| LayoutAlgorithm |
LayoutAlgorithm is a visitor to the LayoutModel.
|
| LayoutAlgorithm.Builder |
|
| MultiRowEdgeAwareTreeLayoutAlgorithm |
A Multi-Row TreeLayoutAlgorithm that can be modified with comparators and predicates for
both vertices and edges
|
| MultiRowEdgeAwareTreeLayoutAlgorithm.Builder |
a Builder to create an instance of a MultiRowEdgeAwareTreeLayoutAlgorithm
|
| MultiRowTreeLayoutAlgorithm |
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
|
| MultiRowTreeLayoutAlgorithm.Builder |
|
| Radial |
marker interface used only to signal that the radial paintables might be applied
|
| RadialEdgeAwareTreeLayoutAlgorithm |
A radial layout for Tree or Forest graphs.
|
| RadialEdgeAwareTreeLayoutAlgorithm.Builder |
|
| RadialTreeLayout |
a marker interface for Tree layouts in a radial pattern
|
| RadialTreeLayoutAlgorithm |
A radial layout for Tree or Forest graphs.
|
| RadialTreeLayoutAlgorithm.Builder |
|
| SpringLayoutAlgorithm |
The SpringLayout package represents a visualization of a set of vertices.
|
| SpringLayoutAlgorithm.Builder |
|
| SpringLayoutAlgorithm.SpringVertexData |
|
| SugiyamaLayoutAlgorithm |
The Sugiyama Hierarchical Minimum-Cross layout algorithm
|
| SugiyamaLayoutAlgorithm.Builder |
a Builder to create a configured instance
|
| TidierRadialTreeLayoutAlgorithm |
A radial layout for Tree or Forest graphs.
|
| TidierRadialTreeLayoutAlgorithm.Builder |
|
| TidierTreeLayoutAlgorithm |
A more compact tree layout algorithm.
|
| TidierTreeLayoutAlgorithm.Builder |
a Builder to create a configured instance of an AnotherTreeLayoutAlgorithm
|
| TreeLayout |
an interface for LayoutAlgorithm that place their vertices in a tree like heirarchy
|
| TreeLayoutAlgorithm |
A simple tree layout algorithm that will allow multiple roots.
|
| TreeLayoutAlgorithm.Builder |
|
| VertexPredicated |
an interface for LayoutAlgorithm with a settable Predicate to filter vertices |
| VertexSorting |
an interface for LayoutAlgorithm with a settable Comparator for vertices
|