Question

I. Use Kruskal's algorithm to find a minimum spanning tree in the weighted graph shown in Fig.1 II. Use Prim's algorithm to find a minimum spanning tree for the weighted graph shown in Fig.2

          I. Use Kruskal's algorithm to find a minimum spanning tree in the weighted graph shown in
Fig.1
II. Use Prim's algorithm to find a minimum spanning tree for the weighted graph shown in
Fig.2

Added by Erik B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Kevin Corkran-Itagaki

Step 1

Kruskal's algorithm: Show more…

Show all steps

Thanks for your feedback!

I. Use Kruskal's algorithm to find a minimum spanning tree in the weighted graph shown in Fig.1 II. Use Prim's algorithm to find a minimum spanning tree for the weighted graph shown in Fig.2 2 D 5 b 4 c b 2 2 3 6 5 3 2 3 2 e 1 p 3 4 2 6 3 4 8 4 2 2 3 u n g 4 h 2 2 Fig.1 Fig.2