Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Boruvka’s algorithm for Minimum Spanning Tree

  • Difficulty Level : Medium
  • Last Updated : 22 Mar, 2017

Following two algorithms are generally taught for Minimum Spanning Tree (MST) problem.

Prim’s algorithm
Kruskal’s algorithm

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

There is a third algorithm called Boruvka’s algorithm for MST which (like the above two) is also Greedy algorithm.  The Boruvka’s algorithm is the oldest minimum spanning tree algorithm was discovered by Boruuvka in 1926, long before computers even existed. The algorithm was published as a method of constructing an efficient electricity network. See following links for the working and applications of the algorithm.


My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!