1,069 views
1 votes
1 votes

Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it)

Algorithms uses min queue in process, my dobut is when it came to choice b/w vertex 'c' and 'd' as at that time both will have 8 has key value, if we choose min as 'd' we get wrong answer, so prism deal with this case?


If you need algo I will given you, or just please refer chapter 23 cormen prim's algorithm.

Please log in or register to answer this question.

Related questions

5 votes
5 votes
3 answers
1
Kapil asked Jan 24, 2017
3,350 views
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ?Any example which favours this ?
1 votes
1 votes
2 answers
2
JPranavc asked Nov 24, 2017
492 views
Hello,I have doubt regarding prims algorithm1)should we choose the lowest cost edge and then implement algo further?2)Or we choose any vertex and then lowest cost edge of...
0 votes
0 votes
0 answers
3
Harsh181996 asked Jan 5, 2017
349 views
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
1 votes
1 votes
0 answers
4
just_bhavana asked Oct 30, 2017
817 views
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.