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

Prim’s algorithm

Kruskal’s algorithm

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.

Sources:

http://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_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.

## Recommended Posts:

- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Reverse Delete Algorithm for Minimum Spanning Tree
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Applications of Minimum Spanning Tree Problem
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Kruskal's Minimum Spanning Tree using STL in C++
- Minimum Product Spanning Tree
- Minimum spanning tree cost of given Graphs
- Find the weight of the minimum spanning tree
- Find the minimum spanning tree with alternating colored edges
- Minimum Spanning Tree using Priority Queue and Array List
- Minimum Bottleneck Spanning Tree(MBST)
- Types of Spanning Tree Protocol (STP)
- Maximum Possible Edge Disjoint Spanning Tree From a Complete Graph
- Problem Solving for Minimum Spanning Trees (Kruskal’s and Prim’s)
- Total number of Spanning Trees in a Graph
- Total number of Spanning trees in a Cycle Graph
- Number of spanning trees of a weighted complete Graph
- Shortest Job First (or SJF) CPU Scheduling Non-preemptive algorithm using Segment Tree
- Karger's algorithm for Minimum Cut | Set 1 (Introduction and Implementation)