prajna.viz.arrange

Class DiagonalArrangement<N,E>

java.lang.Object

prajna.viz.arrange.AbstractArrangement<N>

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

Type Parameters:

N - The node type for the graph

E - The edge type for the graph

All Implemented Interfaces:

Arrangement<N>, GraphArrangement<N,E>

public class DiagonalArrangement<N,E>
extends AbstractArrangement<N>
implements GraphArrangement<N,E>

Arranges the nodes in a diagonal arrangement. The nodes are arranged in a diagonal line, from upper left to lower right. This arrangement is useful for waterfall-type displays.

Author:

Edward Swing

Constructor Summary

Constructors

Constructor and Description
DiagonalArrangement()

Method Summary

Methods

Modifier and Type	Method and Description
void	arrange(Graph<N,E> graph) Arranges the specified Graph
int	getSpacing() Get the spacing value.
boolean	isCondensed() Determines whether the arrangement should be condensed or not.
void	setCondensed(boolean condensedFlag) Sets a flag which determines whether to use a condensed format, in which the nodes are forced to fit in the available space (ignoring the minimum spacing) or alternately extend beyond the actual arrangement boundaries
void	setSpacing(int space) Sets the minimum spacing between nodes.

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

DiagonalArrangement

public DiagonalArrangement()

Method Detail

arrange

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

Arranges the specified Graph

Specified by:

arrange in interface GraphArrangement<N,E>

Parameters:

graph - the graph to be arranged

getSpacing

public int getSpacing()

Get the spacing value. The spacing determines the distance from one node to another.

Returns:

the spacing value

isCondensed

public boolean isCondensed()

Determines whether the arrangement should be condensed or not. If the arrangement is condensed, the spacing parameter is ignored, and the nodes are fit to the arrangement area. Otherwise, the nodes are spaced according to the spacing parameter, even if this exceeds the available arrangement area.

Returns:

if the condensed flag is set.

setCondensed

public void setCondensed(boolean condensedFlag)

Sets a flag which determines whether to use a condensed format, in which the nodes are forced to fit in the available space (ignoring the minimum spacing) or alternately extend beyond the actual arrangement boundaries

Parameters:

condensedFlag - the Condensed Arrangement flag

setSpacing

public void setSpacing(int space)

Sets the minimum spacing between nodes.

Parameters:

space - the minimum spacing between nodes.