Boruvka’s algorithm for Minimum Spanning Tree Improve Improve Like Article Like Save Share Report 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 Last Updated : 21 Oct, 2022 Like Article Save Article Previous Approximate solution for Travelling Salesman Problem using MST Next Naive algorithm for Pattern Searching Share your thoughts in the comments Add Your Comment Please Login to comment...