Question 2.117
87. Use Kruskal’s algorithm to make cable television available for the sites in the accompanying graph, assuming that video can be relayed. The costs of putting in connections are shown.
87.
The edges are added to the minimum-cost spanning tree in this order: GF, JD, IH, KL, HK, IC, JL, Fl, LE, AI, AB.