Grokking Graph Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Boruvka's Algorithm
On this page

Boruvka's algorithm is one of the earliest algorithms for finding the Minimum Spanning Tree (MST) of a connected, undirected graph. Developed by the Czech mathematician Otakar Borůvka in 1926, this algorithm uses a greedy approach and is particularly efficient for parallel processing.

  • Goal: Connect all vertices in the graph with the minimum total edge weight without forming cycles.
  • Process:
    • Initialize each vertex as a separate component: Start with each vertex as its own component.

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page