I. Given graph G1 in Figure 1, and starting from node A, apply the Prim's algorithm...

 

Transcribed Image Text:

I. Given graph G1 in Figure 1, and starting from node A, apply the Prim's algorithm to find the minimal spanning tree of the graph. Only show the final minimal spanning tree. E 17 G 13 12 F B D 14 16 15 11 10 80' A C 6 H L 2 3 I 5 K J Figure 1. Graph Gl I. Given graph G1 in Figure 1, and starting from node A, apply the Prim's algorithm to find the minimal spanning tree of the graph. Only show the final minimal spanning tree. E 17 G 13 12 F B D 14 16 15 11 10 80' A C 6 H L 2 3 I 5 K J Figure 1. Graph Gl