N- The node class
E- The edge class
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.
|Constructor and Description|
|Modifier and Type||Method and Description|
Arranges the graph starting at the focus node.
Arranges the tree starting at the root node.
focusOnMostConnected, getFocusNode, setFocusNode
getMargin, getNodeLocation, getSize, invalidate, setMargin, setNodeLocation, setSize, setSize
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public void arrange(Graph<N,E> graph) throws ArrangementException