Kruskal's Minimum Spanning Tree



Algorithm

1 sort all the edges
2 add the edges from smallest to largest if they dont create a cycle when added, use union find to check for cycles

Kruskal

Joseph Kruskal was born in 1929 in New York. He went to the University of Chicago and got his PhD at Princeton. While working at Bell Labratories in 1956 he came up with what is now known as the Kruskal Algorithm to find minimum spanning trees. Because the algorithm requires all the edges to be sorted the memory usage was too high for computers of the time so it did not meet the demands of Bells clients, so Robert Prim came up with another algorithm for finding minimum spanning trees.

Code
Kruskal.java
Node.java
Edge.java
Graph.java
MainApplet.java