The Ohio Recreation Council is interested in creating bicycle trails connecting the following cities: Akron, Cleveland, Dayton, Toledo, and Youngstown. The distances, in miles, between these cities are given in the table below.

(a) Use Kruskal’s algorithm to determine the minimum-cost spanning tree that would link each city and create the shortest total distance for the bicycle trails. 

(b) If the cost of building bicycle trails is $6100 per mile, what would be the cost of building the trails found in part (a)?

Transcribed Image Text:

Youngs- Akron Cleveland Dayton Toledo town 226 135 Akron 37 57 Cleveland 37 240 123 69 163 Dayton 226 240 265 Toledo 123 184 135 163 Youngstown 57 69 265 184