prajna.viz.arrange

Interface GraphArrangement<N,E>

Type Parameters:

N - The node type for the graph

E - The edge type for the graph

All Superinterfaces:

Arrangement<N>

All Known Implementing Classes:

CircleArrangement, ClusterArrangement, DiagonalArrangement, DirectedArrangement, ProjectionArrangement, RandomArrangement, RectangularArrangement, TargetArrangement, TierArrangement

public interface GraphArrangement<N,E>
extends Arrangement<N>

Interface for all graph arrangements supported by this package. This interface provides a set of methods for arranging graphs which are independent of the actual node type or renderer used.

An Arrangement should attempt to arrange all nodes in the graph or in the cluster containing the specified node. If it does not, an ArrangementException should be thrown to indicate that not all nodes have been arranged.

Author:

Edward Swing

Method Summary

Methods

Modifier and Type	Method and Description
void	arrange(Graph<N,E> graph) Arranges the specified Graph

Methods inherited from interface prajna.viz.arrange.Arrangement

getNodeLocation, getSize, setMargin, setSize, setSize

Method Detail

arrange

void arrange(Graph<N,E> graph)
             throws ArrangementException

Arranges the specified Graph

Parameters:

graph - the graph to be arranged

Throws:

ArrangementException - If there is a problem determining the arrangement