Algorithm used to find the closest point kruskal and groups. If I give the test data given over 2000 points, the closest point in a group, and finally divided into nine groups. Program can be run directly.

Kruskal\.classpath
.......\.project
.......\.settings\org.eclipse.jdt.core.prefs
.......\bin\EdgeNode.class
.......\...\Euclidean distance.txt
.......\...\FastUnionFind.class
.......\...\MinHeap.class
.......\...\result.txt
.......\...\Subset.class
.......\...\test.txt
.......\src\EdgeNode.java
.......\...\Euclidean distance.txt
.......\...\FastUnionFind.java
.......\...\MinHeap.java
.......\...\result.txt
.......\...\Subset.java
.......\...\test.txt
.......\.settings
.......\bin
.......\src
Kruskal

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．