Package org.jungrapht.visualization.layout.algorithms

Support for graph layout algorithms

There are no java.awt imports in this package and its sub packages

Interface Summary

Interface	Description
Balloon	marker interface used only to signal that the balloon layout paintables might be applied
EdgeAwareLayoutAlgorithm<V,E>	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<V,E,T extends EdgeAwareLayoutAlgorithm<V,E>,B extends EdgeAwareLayoutAlgorithm.Builder<V,E,T,B>>
EdgePredicated<E>	an interface for LayoutAlgorithm that can set a Predicate to filter edges
EdgeSorting<E>	an interface for LayoutAlgorithms with a settable Comparator for edges
IterativeLayoutAlgorithm<V>	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.
Layered<V,E>
LayoutAlgorithm<V>	LayoutAlgorithm is a visitor to the LayoutModel.
LayoutAlgorithm.Builder<V,T extends LayoutAlgorithm<V>,B extends LayoutAlgorithm.Builder<V,T,B>>
MultiRow
Radial	marker interface used only to signal that the radial paintables might be applied
RadialTreeLayout<V>	a marker interface for Tree layouts in a radial pattern
ShapeFunctionAware<V>	an interface for LayoutAlgorithm with a settable Shape Function for vertices
TreeLayout<V>	an interface for LayoutAlgorithm that place their vertices in a tree like heirarchy
VertexPredicated<V>	an interface for LayoutAlgorithm with a settable Predicate to filter vertices
VertexSorting<V>	an interface for LayoutAlgorithm with a settable Comparator for vertices

Class Summary

Class	Description
AbstractHierarchicalMinCrossLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
AbstractHierarchicalMinCrossLayoutAlgorithm.Builder<V,E,T extends AbstractHierarchicalMinCrossLayoutAlgorithm<V,E> & EdgeAwareLayoutAlgorithm<V,E>,B extends AbstractHierarchicalMinCrossLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance
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.
AbstractIterativeLayoutAlgorithm.Builder<V,T extends AbstractIterativeLayoutAlgorithm<V>,B extends AbstractIterativeLayoutAlgorithm.Builder<V,T,B>>
AbstractLayoutAlgorithm<V>	For Layout algorithms that can run an 'after' function
AbstractLayoutAlgorithm.Builder<V,T extends AbstractLayoutAlgorithm<V>,B extends AbstractLayoutAlgorithm.Builder<V,T,B>>
AbstractTreeLayoutAlgorithm<V>	A base class for tree layout algorithms.
AbstractTreeLayoutAlgorithm.Builder<V,T extends AbstractTreeLayoutAlgorithm<V>,B extends AbstractTreeLayoutAlgorithm.Builder<V,T,B>>	A Builder to create instances of AbstractTreeLayoutAlgorithm
BalloonLayoutAlgorithm<V>	A Layout implementation that assigns positions to Tree or Graph vertices using associations with nested circles ("balloons").
BalloonLayoutAlgorithm.Builder<V,T extends BalloonLayoutAlgorithm<V>,B extends BalloonLayoutAlgorithm.Builder<V,T,B>>
CircleLayoutAlgorithm<V>	A Layout implementation that positions vertices equally spaced on a regular circle.
CircleLayoutAlgorithm.Builder<V,T extends CircleLayoutAlgorithm<V>,B extends CircleLayoutAlgorithm.Builder<V,T,B>>
DAGLayoutAlgorithm<V,E>	An implementation of Layout suitable for tree-like directed acyclic graphs.
DAGLayoutAlgorithm.Builder<V,E,T extends DAGLayoutAlgorithm<V,E>,B extends DAGLayoutAlgorithm.Builder<V,E,T,B>>
EdgeAwareTreeLayoutAlgorithm<V,E>	A TreeLayoutAlgorithm that can evaluate Comparator and Predicate for both edges and vertices.
EdgeAwareTreeLayoutAlgorithm.Builder<V,E,T extends EdgeAwareTreeLayoutAlgorithm<V,E>,B extends EdgeAwareTreeLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance of an EdgeAwareTreeLayoutAlgorithm
EiglspergerLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
EiglspergerLayoutAlgorithm.Builder<V,E,T extends EiglspergerLayoutAlgorithm<V,E> & EdgeAwareLayoutAlgorithm<V,E>,B extends EiglspergerLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance
ForceAtlas2LayoutAlgorithm<V>	Implementation of ForceAtlas2 algorithm.
ForceAtlas2LayoutAlgorithm.Builder<V,T extends ForceAtlas2LayoutAlgorithm<V>,B extends ForceAtlas2LayoutAlgorithm.Builder<V,T,B>>
FRLayoutAlgorithm<V>	Implements the Fruchterman-Reingold force-directed algorithm for vertex layout.
FRLayoutAlgorithm.Builder<V,T extends FRLayoutAlgorithm<V>,B extends FRLayoutAlgorithm.Builder<V,T,B>>
GEMLayoutAlgorithm<V,E>	Java implementation of the gem 2D layout.
GEMLayoutAlgorithm.Builder<V,E,T extends GEMLayoutAlgorithm<V,E>,B extends GEMLayoutAlgorithm.Builder<V,E,T,B>>
HierarchicalMinCrossLayoutAlgorithm<V,E>	A Hierarchical Minimum-Cross layout algorithm based on Sugiyama.
HierarchicalMinCrossLayoutAlgorithm.Builder<V,E,T extends HierarchicalMinCrossLayoutAlgorithm<V,E> & EdgeAwareLayoutAlgorithm<V,E>,B extends HierarchicalMinCrossLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance
ISOMLayoutAlgorithm<V>	Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.
ISOMLayoutAlgorithm.Builder<V,T extends ISOMLayoutAlgorithm<V>,B extends ISOMLayoutAlgorithm.Builder<V,T,B>>
KKLayoutAlgorithm<V>	Implements the Kamada-Kawai algorithm for vertex layout.
KKLayoutAlgorithm.Builder<V,T extends KKLayoutAlgorithm<V>,B extends KKLayoutAlgorithm.Builder<V,T,B>>
KKLayoutAlgorithm.Pair<V>
LayoutAlgorithm.NoOp<V>
MultiRowEdgeAwareTreeLayoutAlgorithm<V,E>	A Multi-Row TreeLayoutAlgorithm that can be modified with comparators and predicates for both vertices and edges
MultiRowEdgeAwareTreeLayoutAlgorithm.Builder<V,E,T extends MultiRowEdgeAwareTreeLayoutAlgorithm<V,E>,B extends MultiRowEdgeAwareTreeLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create an instance of a MultiRowEdgeAwareTreeLayoutAlgorithm
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
MultiRowTreeLayoutAlgorithm.Builder<V,T extends MultiRowTreeLayoutAlgorithm<V>,B extends MultiRowTreeLayoutAlgorithm.Builder<V,T,B>>
RadialEdgeAwareTreeLayoutAlgorithm<V,E>	A radial layout for Tree or Forest graphs.
RadialEdgeAwareTreeLayoutAlgorithm.Builder<V,E,T extends RadialEdgeAwareTreeLayoutAlgorithm<V,E>,B extends RadialEdgeAwareTreeLayoutAlgorithm.Builder<V,E,T,B>>
RadialTreeLayoutAlgorithm<V>	A radial layout for Tree or Forest graphs.
RadialTreeLayoutAlgorithm.Builder<V,T extends RadialTreeLayoutAlgorithm<V>,B extends RadialTreeLayoutAlgorithm.Builder<V,T,B>>
SpringLayoutAlgorithm<V,E>	The SpringLayout package represents a visualization of a set of vertices.
SpringLayoutAlgorithm.Builder<V,E,T extends SpringLayoutAlgorithm<V,E>,B extends SpringLayoutAlgorithm.Builder<V,E,T,B>>
SpringLayoutAlgorithm.SpringVertexData
StaticLayoutAlgorithm<V>	StaticLayout leaves the vertices in the locations specified in the LayoutModel, and has no other behavior.
SugiyamaLayoutAlgorithm<V,E>	The Sugiyama Hierarchical Minimum-Cross layout algorithm
SugiyamaLayoutAlgorithm.Builder<V,E,T extends SugiyamaLayoutAlgorithm<V,E> & EdgeAwareLayoutAlgorithm<V,E>,B extends SugiyamaLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance
TidierRadialTreeLayoutAlgorithm<V,E>	A radial layout for Tree or Forest graphs.
TidierRadialTreeLayoutAlgorithm.Builder<V,E,T extends TidierRadialTreeLayoutAlgorithm<V,E>,B extends TidierRadialTreeLayoutAlgorithm.Builder<V,E,T,B>>
TidierTreeLayoutAlgorithm<V,E>	A more compact tree layout algorithm.
TidierTreeLayoutAlgorithm.Builder<V,E,T extends TidierTreeLayoutAlgorithm<V,E>,B extends TidierTreeLayoutAlgorithm.Builder<V,E,T,B>>	a Builder to create a configured instance of an AnotherTreeLayoutAlgorithm
TreeLayoutAlgorithm<V>	A simple tree layout algorithm that will allow multiple roots.
TreeLayoutAlgorithm.Builder<V,T extends TreeLayoutAlgorithm<V>,B extends TreeLayoutAlgorithm.Builder<V,T,B>>	A Builder to create instances of TreeLayoutAlgorithm