15
The two algorithms serve to generate a Minimum Generating Tree of a Graph.
In the Prim
- Generates a single tree
- Throughout the algorithm, the set X is always a tree
In the Kruskal
- Generates a forest, before generating a Minimum Generating Tree
- It is guaranteed to be only one tree after the last iteration
But the bigger question is:
What would be the Upside and Downside among them?
Additional information
- Algorithm of Dijkstra solves the shortest path problem in a graph.
- Algorithm of Dijkstra and Prim are almost exactly the same, but in Prim you do not sum the obtained result, but the execution is equal.
- The use of these two algorithms are for distinct problems (no are related to the same problem). One solves the shortest path while the other generates an AGM.
If I’m not mistaken Kruskal is possible to be distributed...
– Jefferson Quesado
Related question: https://answall.com/questions/123522/diferen%C3%A7a-na-aplica%C3%A7%C3%A3o-dos-algoritmos-de-dijkstra-e-prim
– mercador