CS 302 Assignment 6: Finding a minimum spanning tree.

Due date: Tuesday, October 13, 2009, 8:00 AM.
Do not hand it in at that time. Just have it running so that we can discuss it in class.
I want you to have a correct program that solves the problem. Your correct problem could be very inefficient. What I will show you in class is how to write a progam that is both correct and efficient.

Write a program which
  1. Read in a weighted graph. The number of vertices will not exceed 100.
  2. Find the minimum weight of a spanning tree for the graph, and also find a minimum spanning tree, using Kruskal's algorithm.
  3. Here are some practice graphs:
  4. A weighted graph with 5 vertices.
    A weighted graph with 100 vertices.
    Another graph.
    Another graph.
    Another graph.