N- The node type for the graph
E- The edge type for the graph
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.