Kruskal's Algorithm/Also known as
Jump to navigation
Jump to search
Kruskal's Algorithm: Also known as
It is clear that Kruskal's Algorithm is a greedy algorithm: at each stage the minimum possible weight is chosen, without any analysis as to whether there may be a combination of larger weights which may produce a smaller-weight spanning tree.
For this reason, it is sometimes called Kruskal's Greedy Algorithm.