title: Create N-Clusters out of Min spanning tree?
body: <p>Let say I created a Minimum Spanning Tree out of Graph with M nodes. Is there an algorithm to create N number of clusters.</p>
  <p>I'm looking to cut some of the links such as that I end up with N clusters and label them i.e. given a node X I can query in which  cluster it belongs.</p>
  <hr />
  <p>What I think is once I have the MST, I cut the top/max M-N edges of the MST and I will get N clusters ?</p>
  <p>Is my logic correct ?</p>