Find a minimum-weight spanning tree of the graph given in Example 10.4.1. First use any method you like, then do it using Kruskal's algorithm, and then again using Prim's algorithm. How do your minimum-weight spanning trees differ from each other?
Example 10.4.1
Minimum-weight spanning trees are eminently practical. Suppose you want to create a high-speed computer cluster from existing machines so that the processing power of the machines can be utilized around the clock.