This project provides a simple and clean C++ implementation of Kruskal's Algorithm, a classic greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected, and weighted ...