Kruskal Minimum Spanning Tree Algorithm

Reading time: 15 minutes | Coding time: 9 minutes

Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.

This is a companion discussion topic for the original entry at