Package edu.uci.ics.jung.algorithms.layout
package edu.uci.ics.jung.algorithms.layout
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
Current layout algorithms include:
Layout, AbstractLayout
: interface and abstract class defining the Layout contract and handling some common implementation detailsAggregateLayout
: allows multiple layouts to be combined and manipulated as one layoutBalloonLayout
: places vertices on nested circles (trees/forests only)CircleLayout
: places vertices on a circleDAGLayout
: places vertices in a hierarchy (directed acyclic graphs only)FRLayout
: Fruchterman-Reingold algorithm (force-directed)ISOMLayout
: self-organizing map layoutKKLayout
: Kamada-Kawai algorithm (tries to maintain specified distances)RadialTreeLayout
: places vertices on concentric circles (trees only)SpringLayout
: simple force-directed layoutStaticLayout
: places vertices at user-specified locationsTreeLayout
: simple tree/forest layout
visualization
package.-
ClassDescriptionAbstractLayout<V,
E> Abstract class for implementations ofLayout
.AggregateLayout<V,E> ALayout
implementation that combines multiple other layouts so that they may be manipulated as one layout.BalloonLayout<V,E> ALayout
implementation that assigns positions toTree
orForest
vertices using associations with nested circles ("balloons").CircleLayout<V,E> ALayout
implementation that positions vertices equally spaced on a regular circle.DAGLayout<V,E> An implementation ofLayout
suitable for tree-like directed acyclic graphs.FRLayout<V,E> Implements the Fruchterman-Reingold force-directed algorithm for node layout.FRLayout2<V,E> Implements the Fruchterman-Reingold force-directed algorithm for node layout.GraphElementAccessor<V,E> Interface for coordinate-based selection of graph components.ISOMLayout<V,E> Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.KKLayout<V,E> Implements the Kamada-Kawai algorithm for node layout.Layout<V,E> A generalized interface is a mechanism for returning (x,y) coordinates from vertices.LayoutDecorator<V,E> a pure decorator for the Layout interface.Represents a point in polar coordinates: distance and angle from the origin.RadialTreeLayout<V,E> A radial layout for Tree or Forest graphs.Simple implementation of PickSupport that returns the vertex or edge that is closest to the specified location.SpringLayout<V,E> The SpringLayout package represents a visualization of a set of nodes.SpringLayout2<V,E> The SpringLayout package represents a visualization of a set of nodes.StaticLayout<V,E> StaticLayout places the vertices in the locations specified by its initializer, and has no other behavior.TreeLayout<V,E>