0
Still curious? Ask our experts.
Chat with our AI personalities
Professor
Steve
LaoAdd your answer:
Earn +20 pts
Write a program to implement prim's algorithm?
dfgbrgffee
Which one is better kruhskal's algorithm or prim's algorithm?
Both algorithms have the same efficiency and both are based on the same greedy approach. But Kruskal's algorithm is much easier to implement.
What is the Complexity of kruskal and prim's algorithm?
Complexity prim = O(E+ V logV). E edge and V vertex. kurskal = O(E lgV ).
Will either kruskal or prim's algorithm work on negative edge graph?
The correctness of either Prim's or Kruskal's algorithm, is not affected by negative edges in the graph. They both work fine with negative edges. The question boils down to "Does a Priority Queue of numbers work with negative numbers?" because of the fact that both Prim's and Kruskal's algorithm use a priority queue. Of course -- as negative numbers are simply numbers smaller than 0. The "<" sign will still work with negative numbers.
How does Prim's algorithm differ from Kruskal's and Dijkstra's algorithms?
First a vertex is selected arbitrarily. on each iteration we expand the tree by simply attaching to it the nearest vertex not in the tree. the algorithm stops after all yhe graph vertices have been included.. one main criteria is the tree should not be cyclic.
