Find a minimum spanning tree in the following weighted graph using Prim's algorithm.

Name: Find a minimum spanning tree in the following weighted graph using Prim's algorithm.
Brand: Quizplus
Rating: 4.8 (35 reviews)

Question

Quizplus · Accepted Answer

The Answer is Prim's algorithm adds the edges {d, e} of weight 1, {e, h} of weight 1, {e, f} of weight 2, {d, g} of weight 3, {g, a} of weight 2, {a, b} of weight 2, {b, c} of weight 3, and {c, i} of weight 3. The total weight of the minimum spanning tree is 17.

Find a Minimum Spanning Tree in the Following Weighted Graph