CS 303L Data Structure and Algorithm
April 3, 2008
Programming Assignment 5
(Due on April 17, 2008)
In this assignment, we are going to solve the question of the minimum spanning tree with
weighted graphs. Suppose you run a cable company, and you want to install a cable television
line that connects some cities in Alabama, Georgia, and Florida.
The following figure represents all possible routes for installing cable television lines between
cities in Alabama, Georgia, and Florida. The red dots represent cities, the orange lines indicate
the possible routes for installing a cable television line, and the blue numbers show the distance,
which implies the cost, between the two cities. The cost of connecting each pair of cities varies,
so you must pick the route carefully to minimize the overall cost. (Two-page report is required)