What is the primary difference between Prim's and Kruskal's algorithms? - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
2 followers study24x7 22 Aug 2024 10:28 AM study24x7 study24x7

What is the primary difference between Prim's and Kruskal's algorithms?

A

Prim's algorithm is used for shortest path finding, while Kruskal's is used for minimum spanning trees

B

Prim's requires a starting vertex; Kruskal's does not

C

Prim's is a greedy algorithm; Kruskal's is not

D

Prim's can handle negative edge weights; Kruskal's cannot

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles