Kruskal's MST Algorithm is a well known solution to the Minimum Spanning Tree (MST) problem, which consists in finding a subset of the edges of a connected weighed graph, such that it satisfies two properties: it maintains connectivity, and the sum of the weights of the edges in the set is minimized. This implementation shows the step-by-step progress of the algorithm.

This work is part of a social service project consisting in the implementation of several graph theory algorithms with step-by-step execution, intended to be used as a teaching aid in graph theory related courses. See also applications for Prim’s Minimum Spanning Tree, Ford-Bellman’s Shortest Path, and Dijkstra’s Shortest Path.