Kruskal's Algorithm
MST Problem:
Given a connected graph G=(V,E) and a weight d:E->R+, find a minimum spanning tree T.
JAVA applet demos of Kruskal's algorithm.
a (6,9) graph
a (5,8) graph
a (12,23) graph