Boruvka’s algorithm for Minimum Spanning Tree

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 Boruvka 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

Article Tags :

DSA

Greedy

Recommended Articles

1. Spanning Tree vs Minimum Spanning Tree

2. Boruvka's algorithm | Greedy Algo-9

3. Which Minimum Spanning Tree Algorithm is better?

4. Kruskal’s Minimum Spanning Tree (MST) Algorithm

5. Reverse Delete Algorithm for Minimum Spanning Tree

6. Prim’s Algorithm for Minimum Spanning Tree (MST)

7. Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)

8. Maximum Spanning Tree using Prim’s Algorithm

9. Minimum spanning tree cost of given Graphs

10. Find the minimum spanning tree with alternating colored edges

11. Minimum Spanning Tree using Priority Queue and Array List

12. Second Best Minimum Spanning Tree

13. Difference between Minimum Spanning Tree and Shortest Path

14. Properties of Minimum Spanning Tree (MST)

15. Check if an edge is a part of any Minimum Spanning Tree

16. Applications of Minimum Spanning Tree

17. Minimum Bottleneck Spanning Tree(MBST)

18. Kruskal's Minimum Spanning Tree using STL in C++

19. Minimum Product Spanning Tree

20. Find the weight of the minimum spanning tree

21. What is Minimum Spanning Tree (MST)

22. Types of Spanning Tree Protocol (STP)

23. Maximum Possible Edge Disjoint Spanning Tree From a Complete Graph

24. Spanning Tree

25. Find Edge Weights in a Spanning Tree with Edge (u, v)