1.3k views

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

1. $29$
2. $31$
3. $38$
4. $41$
edited | 1.3k 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
0
yes prims is easier to apply than kruskal here ...
0
what if we apply the kruskal here?
0
@lakshaysaini2013

Nothing, answer will be same, you just have to avoid any cycle/loop.
Solution: B

The minimum spanning tree is

0

1
2