Description: 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.
To Search:
File list (Check if you may need any files):
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
Download