# minimum spanning tree

138 views

0
73??
0
Yes but i am getting 75.
please tell the solution.
0
Hope this clears your doubt.

Ans is 73.

selected
0
yes.

## Related questions

1
176 views
Which algorithm will be implemented on the weighted graph in which the edges are uniformly distributed over the half-open interval $[0,1)$ to construct MST so that it runs in linear time? $A)$ Kruskal's algorithm $B)$ Prim's algorithm $C)$ Both $(A)$ and $(B)$ $D)$ None of these