Related questions with answers


A school consists of 66 separate buildings, represented by the vertices in the graph. There are paths between some of the buildings as shown. The graph also shows the length in feet of each path. School administrators want to cover some of these paths with roofs so that students will be able to walk between buildings without getting wet when it rains. To minimize cost, they must select paths to be covered such that the total length to be covered is as small as possible. Use Kruskal's algorithm to determine which paths to cover. Also determine the total length of pathways to be covered.


Answered 1 year ago
Answered 1 year ago
Step 1
1 of 6

Start by choosing the edge with the least weight.'slader'

Create an account to view solutions

Create an account to view solutions

More related questions