Uses of Class
edu.uci.ics.jung.algorithms.layout.AbstractLayout
Packages that use AbstractLayout
Package
Description
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
-
Uses of AbstractLayout in edu.uci.ics.jung.algorithms.layout
Subclasses of AbstractLayout in edu.uci.ics.jung.algorithms.layoutModifier and TypeClassDescriptionclass
CircleLayout<V,
E> ALayout
implementation that positions vertices equally spaced on a regular circle.class
DAGLayout<V,
E> An implementation ofLayout
suitable for tree-like directed acyclic graphs.class
FRLayout<V,
E> Implements the Fruchterman-Reingold force-directed algorithm for node layout.class
FRLayout2<V,
E> Implements the Fruchterman-Reingold force-directed algorithm for node layout.class
ISOMLayout<V,
E> Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.class
KKLayout<V,
E> Implements the Kamada-Kawai algorithm for node layout.class
SpringLayout<V,
E> The SpringLayout package represents a visualization of a set of nodes.class
SpringLayout2<V,
E> The SpringLayout package represents a visualization of a set of nodes.class
StaticLayout<V,
E> StaticLayout places the vertices in the locations specified by its initializer, and has no other behavior.