Displays the input graph in a "hierarchical" layout.

Show the same graph but now each link is annotated with the centrality score of the link. See here for an explanation of minimal cut, modularity and centrality score.

Select the numer of clusters into which you want to divide the graph.
The clustering is achieved by deleting the link with the highest centrality score and than recomputing the centralities. This process is repeated until the graph falls apart into n clusters.