Objective:

IN JAVA

Implement Kruskals algorithm and run it on a weighted graph of your own creation. The algorithm is used to find the minimum spanning tree in a graph. This is a greedy algorithm that examines each edge of the graph and only keeps the connections that are the smallest while still keeping a connection to that node. For more information look here:

http://en.wikipedia.org/wiki/Kruskal%27s_algorithm

Demonstrate the algorithm works by printing out every edge with weights in your graph, and then printing out the minimum spanning tree.