Kruskal's algorithm - Wikipedia, the free encyclopedia

Kruskal's algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the  ...

en.wikipedia.org