Dividing MST for kruskal clustering
In Kruskal's algorithm, MST edges are added in order of increasing weight.
If you're starting with an MST and you want to get the same effect as stopping Kruskal's algorithm when there are N connected components, then just delete the N-1 highest-weight edges in the MST.
I made a c# application that draw random point on the panel. I need to cluster this points according to euclidian distance. I already implement kruskal algorithm. Normally, there must be number of minimum spanning tree up to written number. For instance, when the user want to clusters drawn point for 3 clusters , end of the kruskal algorithm there must be 3 huge MST. 
But I did it in a different way. I made a one huge  MST, now I have to divide this MST into written number of clusters.
For example, point number = 5 , cluster number 2  my kruskal output is = 0-3:57  1-2:99  1-4:102 
from-to:euclidian distance 
Problem is I don't know in where I should cut these MST for create clusters