This program is the implementation of Fast Minimum Spanning Tree using Kmeans in the research paper FMST.pdf. The proposed algorithm employs a divide-and-conquer scheme to produce an approximate MST with theoretical time complexity of O(N^1.5), which is faster than the conventional MST algorithms with O(N²). It consists of two stages Divide & Conquer Stage and the Refinement Stage. The Kmeans uses √N clusters in Divide & Conquer Stage and √N-1 clusters in Refinement Stage.