In graph theory, what algorithm is used to find the minimum spanning tree for a connected weighted graph?

  • Bellman-Ford Algorithm
  • Dijkstra's Algorithm
  • Kruskal's Algorithm
  • Prim's Algorithm
Prim's Algorithm is used to find the minimum spanning tree for a connected weighted graph. It starts with an arbitrary node and greedily adds the shortest edge that connects a vertex in the tree to a vertex outside the tree until all vertices are included.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *