Boruvka's Algorithm

Explanation

- **Boruvka's Algorithm** is another greedy algorithm used to find the **minimum spanning tree (MST)** of a graph. It repeatedly adds the minimum weight edge from each component until only one component remains.

-

• Steps:

  • Initially, each vertex is considered a separate component.
  • For each component, find the minimum weight edge that connects it to another component.
  • Add these edges to the MST and merge the components.
  • Repeat until there is only one component.

• Time Complexity:

  • O(E log V), where V is the number of vertices and E is the number of edges.