zahn_algorithm,Using python and libraries Networkx and Scilearn

Write a function that takes as an input a collection of points and a number of clusters and returns back k clusters of the using Zahns clustering algorithm. The points can be in any Euclidian space.

1.Compute the EMST of X.

2.Sort the edges of EMST(X)in decreasing order.

3.Delete the longest k-1 edges of EMST(X).

4.Return the k connected components (clusters)of the resulting forest.