Minimal cut graph splitting

The textarea on the left specifies a graph. (see here for a short explanation)
The layout of the graphs on this page is computed in real time (javascript should be enabled).
This layout process is only meant for illustration puposes.
For much better hierarchical layouts in reusable svg-format you should use the pages marked with GraphViz layout.
The Buttons:

Graph
Displays the graph in a "force directed" layout. The force between two nodes is proportional to the weight of the edge conncecting the nodes. The weights may range from 1 (low force) to 9 (high force)
Tree
Displays the Gomory Hu tree of the graph. Here you can see possible clusters and choose the best cut.
Split
The graph is divided into two clusters. The split is along the minimal cut between the first two nodes specified in the text area (A5 and A1 in the example graph on the left). If you want the split calculated between two different nodes you have to move these nodes to the top in the text area.
See here for an explanation of minimal cut, modularity and centrality score.