Kruskal's Minimum Spanning Tree

Joseph Kruskal, 1956

Published by Joseph Kruskal in 1956, this algorithm constructs a minimum spanning tree by processing edges in ascending order of weight. For each edge, it uses a union-find data structure to check whether adding the edge would form a cycle; if not, the edge joins the MST. The visualization shows the current edge under consideration in gold, accepted MST edges in teal, and rejected edges (those forming cycles) flashing coral before fading.