CS230 - Assignment 6

You are to implement Kruskal’s minimum cost spanning tree algorithm in the language of your choice.

 Your program should input an undirected weighted graph, G, in some reasonable manner.  The output should be the edges which compose the minimum cost spanning tree of G.  In addition to producing the correct output, be sure that you implementation time is O(|E|log|E|).

 You will need to implement the Make-Set, Union, and FindSet algorithms discussed in class so that the Union operation can be performed in time O(1) and the FindSet operation can be performed in O(log n).  If you choose, you may implement path compression for extra credit.

 Test your program on the following graph and any others of your choosing.  For grading purposes you will need to demonstrate the operation of your algorithm to me and e-mail your source code to me.  You will be graded on correctness, program efficiency, and clear and concise code.