prajna.viz.arrange

Class TierArrangement<N,E>

java.lang.Object

prajna.viz.arrange.AbstractArrangement<N>

prajna.viz.arrange.FocusArrangement<N>

prajna.viz.arrange.TierArrangement<N,E>

Type Parameters:

N - The node class

E - The edge class

All Implemented Interfaces:

Arrangement<N>, GraphArrangement<N,E>, TreeArrangement<N>

public class TierArrangement<N,E>
extends FocusArrangement<N>
implements GraphArrangement<N,E>, TreeArrangement<N>

Arrangement class which will arrange the nodes in a hierarchical layout. The nodes are arranged with the focusNode as the root on the top (lowest Y value). The Arrangement will attempt to make the best decision about how to arrange the nodes. If there is no specified root, an ArrangementException is thrown.

The nodes are arranged in tiers, and the arrangement attempts to fit the nodes within each level in the best way it can. The levels will be arranged in such a way that the nodes at each layer are spaced evenly.

Author:

Edward Swing

Constructor Summary

Constructors

Constructor and Description
TierArrangement()

Method Summary

Methods

Modifier and Type	Method and Description
void	arrange(Graph<N,E> graph) Arranges the graph starting at the focus node.
void	arrange(Tree<N> tree) Arranges the tree starting at the root node.

Methods inherited from class prajna.viz.arrange.FocusArrangement

focusOnMostConnected, getFocusNode, setFocusNode

Methods inherited from class prajna.viz.arrange.AbstractArrangement

getMargin, getNodeLocation, getSize, invalidate, setMargin, setNodeLocation, setSize, setSize

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface prajna.viz.arrange.Arrangement

getNodeLocation, getSize, setMargin, setSize, setSize

Constructor Detail

TierArrangement

public TierArrangement()

Method Detail

arrange

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

Arranges the graph starting at the focus node. All other connected nodes are arranged. In this case, the Arrangement attempts to arrange the tree using the focus node as the root node. The arrangement will attempt to arrange in levels based upon distance from the specified node.

Specified by:

arrange in interface GraphArrangement<N,E>

Parameters:

graph - the graph to be arranged

Throws:

ArrangementException - if the graph does not contain a tree structure

arrange

public void arrange(Tree<N> tree)

Arranges the tree starting at the root node.

Specified by:

arrange in interface TreeArrangement<N>

Parameters:

tree - the tree to be arranged