The diagram shows a network of roads between five stations , , , and . The travel time in minutes along each road is given in the table below. There is no road between any other pair of stations.
Find the total travel time, in minutes, of a minimum spanning tree for this network.
Worked solution
Triangle has roads , and minutes, so the longest road is left out.
Triangle has roads , and minutes, so the longest road is left out.
The minimum spanning tree uses , , and , with total length minutes.
Answer
Marking guidelines
Removes the longest road from each of the two triangles in the network, so that no cycle remains | 1 mark |
Adds the four remaining road times to find the total length of the tree | 1 mark |
Report a problem with this question.
