Kruskal's Algorithm for Minimum Cost Spanning Tree

An exploration of Kruskal's algorithm, a fundamental method in graph theory used to determine the minimum cost spanning tree of a connected, undirected graph.