Assignment 5 : Due Tuesday, August 15th

General Rules:

1. Program must be written in C++.
2. Must hand in source code, and "script" of program runs.
3. Grades discounted 10% per day late.

Project Description:


     Implement Kruskal's algorithm as described in 9.5.2.
     The program will read a undirected graph description from a file, 
     formatted as follows:
	one line containing a single integer ,
	followed by |E| (i.e. the number of edges) lines, each 
        containing three integers:
	
        {for example:
	7
	3 6 9
	2 4 1
	1 4 3}
        
        the first number is the number of nodes (your file must have at
	least 25); each line thereafter denotes an edge, the 
	first two numbers are the nodes connected (assume these numbers
        will always be legit nodes) and the last number 
	the weight of the edge. 

	The output will be a list of edges and the total weight of the
	spanning tree.
     
     The key to this program will be selecting and implementing the
     data structures used to implement the algorithm.  In your 
     header comment, identify the structures selected and justify
     your choice (based on speed, space, ease of implementation etc).