edited by
664 views
2 votes
2 votes
Please can anyone tell me though Prim’s and Kruskal’s algorithms are greedy algorithms. Greedy algorithms always give local optimum solutions but how Prim’s and Kruskal’s algorithms are giving global optimum solutions why?
edited by

Please log in or register to answer this question.

Related questions

5 votes
5 votes
3 answers
1
Kapil asked Jan 24, 2017
3,351 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 ?
2 votes
2 votes
2 answers
2
Psy Duck asked Jun 24, 2023
907 views
Can anyone help in solving the question 105 to 109.I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
2 votes
2 votes
3 answers
3
Geet asked Oct 26, 2016
1,592 views
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
3 votes
3 votes
1 answer
4
Pooja Palod asked Oct 15, 2015
2,990 views
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?