Following two algorithms are generally taught for Minimum Spanning Tree (MST) problem.
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.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Reverse Delete Algorithm for Minimum Spanning Tree
- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- 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
- Minimum Bottleneck Spanning Tree(MBST)
- Applications of Minimum Spanning Tree Problem
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Find the minimum spanning tree with alternating colored edges
- Minimum Spanning Tree using Priority Queue and Array List
- 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)
- Shortest Job First (or SJF) CPU Scheduling Non-preemptive algorithm using Segment Tree
- Karger’s algorithm for Minimum Cut | Set 2 (Analysis and Applications)
- Karger's algorithm for Minimum Cut | Set 1 (Introduction and Implementation)
- Greedy Algorithm to find Minimum number of Coins
- Karp's minimum mean (or average) weight cycle algorithm