Q3 [25 pts.]: Execute Prim's minimum spanning tree algorithm by hand on the graph in Fig.2, showing how the data structures evolve. Clearly indicate which edges become part of the minimum spanning tree and in what order. Start at vertex H.
Q3 [25 pts.]: Execute Prim's minimum spanning tree algorithm by hand on the graph in Fig.2, showing how the data structures evolve. Clearly indicate which edges become part of the minimum spanning tree and in what order. Start at vertex H.
2
4
B
3
3
2
2
Fig.2
