search
Log In
0 votes
87 views

in Algorithms
edited by
87 views
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

Please log in or register to answer this question.

Related questions

–1 vote
1 answer
1
0 votes
0 answers
2
141 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
asked Nov 10, 2018 in Algorithms Lakshman Patel RJIT 141 views
3 votes
1 answer
3
653 views
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle
asked Apr 30, 2018 in Algorithms srestha 653 views
1 vote
0 answers
4
285 views
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same 2. Mst will remain same Right? Note : Here i am doubling or tripling or four times ..... not increasing by +c
asked Feb 19, 2018 in Algorithms Na462 285 views
...