# Ace Test Series: Algorithms - Minimum Spanning Tree

87 views

edited
0
According to me if we apply Prim's algorithm then we will get <ab> = 6 because if we start from 'a' we will choose -2 and reach 'c' and then if we choose 5<ed> among 5<ed> and <ab> then obviously <ab> should be greater than 5. So, according to me, the minimum should have been 6. But the answer says something else.
0
question is wrong specified many times ....that wavy edge thing i remember ....... it is wrong

## Related questions

–1 vote
1
167 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