0 votes 0 votes Algorithms minimum-spanning-tree kruskals-algorithm test-series + – Churchill Khangar asked Nov 22, 2018 • retagged Jul 16, 2022 by makhdoom ghaya Churchill Khangar 579 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply goxul commented Nov 22, 2018 reply Follow Share Where are these questions from? Can you please post the source? 0 votes 0 votes Deepanshu commented Nov 22, 2018 reply Follow Share i think prims better 0 votes 0 votes kumar.dilip commented Nov 22, 2018 reply Follow Share a Prim's Algorithm. 0 votes 0 votes Churchill Khangar commented Nov 23, 2018 reply Follow Share @goxul, they are asked in course work at IITD EET 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes Also, Prim's should be better as Kruskal would involving sorting the edges, which is not feasible when you millions of them. https://stackoverflow.com/questions/1195872/kruskal-vs-prim goxul answered Nov 22, 2018 • selected Nov 23, 2018 by Churchill Khangar goxul comment Share Follow See all 0 reply Please log in or register to add a comment.
