N - The node classE - The edge classpublic class RandomArrangement<N,E> extends AbstractArrangement<N> implements GraphArrangement<N,E>, TreeArrangement<N>
| Constructor and Description |
|---|
RandomArrangement() |
| Modifier and Type | Method and Description |
|---|---|
void |
arrange(Graph<N,E> graph)
Arranges the specified Graph
|
void |
arrange(Tree<N> tree)
Arrange the specified tree
|
void |
updateArrangement(Graph<N,E> graph)
Arranges only those nodes which have not already had a location
determined.
|
void |
updateArrangement(Tree<N> tree)
Arranges only those nodes which have not already had a location
determined.
|
getMargin, getNodeLocation, getSize, invalidate, setMargin, setNodeLocation, setSize, setSizeclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetNodeLocation, getSize, setMargin, setSize, setSizepublic void arrange(Graph<N,E> graph)
arrange in interface GraphArrangement<N,E>graph - the graph to be arrangedpublic void arrange(Tree<N> tree)
arrange in interface TreeArrangement<N>tree - the tree to arrangepublic void updateArrangement(Graph<N,E> graph)
graph - the graph to arrange