Assignment-4 (1 September 2015)

Upgrade your earlier implementation of Kruskal's algorithm by adding the following:

• Add a second function for implementation of Find_Min(L) using heaps.
• Modify the code so that one of the Find_Min functions can be chosen during compilation.
• Use command line arguments to choose input file for reading data set and the output file to write the results.
• Modify the program so that the time complexity of the program can be measured: count the number of comparisons in Find_Min and the number of times the function If_Cycle(PT, edge) is run to output the MST.

The program should output the MST, its weight and the time complexity. Sample test files of different sizes will be provided.