Instructions

Your second programming assignment is to implement Kruskal’s minimum spanning tree algorithm. The main objective of this assignment is to empirically validate the most efficient implementation of Kruskal’s algorithm. Hence, the sub-objectives of this assignment are: 1. To implement the Union-Find data structure; 2. To use union-find data structure to develop an efficient implementation of Kruskal’s algorithm; and 3. To validate the theoretical best runtime complexity for Kruskal’s algorithm using empirical results; Thus, you are expected to properly demonstrate that you were able to achieve these objectives through documented work listed in your project report