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 details
  • AggregateLayout: allows multiple layouts to be combined and manipulated as one layout
  • BalloonLayout: places vertices on nested circles (trees/forests only)
  • CircleLayout: places vertices on a circle
  • DAGLayout: places vertices in a hierarchy (directed acyclic graphs only)
  • FRLayout: Fruchterman-Reingold algorithm (force-directed)
  • ISOMLayout: self-organizing map layout
  • KKLayout: Kamada-Kawai algorithm (tries to maintain specified distances)
  • RadialTreeLayout: places vertices on concentric circles (trees only)
  • SpringLayout: simple force-directed layout
  • StaticLayout: places vertices at user-specified locations
  • TreeLayout: simple tree/forest layout
Rendering and other aspects of visualization are handled in the visualization package.
  • Class
    Description
    AbstractLayout<V,E>
    Abstract class for implementations of Layout.
    AggregateLayout<V,E>
    A Layout implementation that combines multiple other layouts so that they may be manipulated as one layout.
    BalloonLayout<V,E>
    A Layout implementation that assigns positions to Tree or Forest vertices using associations with nested circles ("balloons").
    CircleLayout<V,E>
    A Layout implementation that positions vertices equally spaced on a regular circle.
    CircleLayout.CircleVertexData
     
    DAGLayout<V,E>
    An implementation of Layout suitable for tree-like directed acyclic graphs.
    FRLayout<V,E>
    Implements the Fruchterman-Reingold force-directed algorithm for node layout.
    FRLayout.FRVertexData
     
    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.
    ISOMLayout.ISOMVertexData
     
    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.
    PolarPoint
    Represents a point in polar coordinates: distance and angle from the origin.
    RadialTreeLayout<V,E>
    A radial layout for Tree or Forest graphs.
    RadiusGraphElementAccessor<V,E>
    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.
    SpringLayout.SpringVertexData
     
    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>