896 views

What is the weight of a minimum spanning tree of the following graph?

1. $29$
2. $31$
3. $38$
4. $41$
edited | 896 views

Apply Prim's algorithm, start from A as shown in figure below.

add all the weights in the given figure which would be equal to $31$.

edited by
yes prims is easier to apply than kruskal here ...
Solution: B

The minimum spanning tree is