📄️ Kruskal's AlgorithmKruskal's algorithm finds the minimum spanning forest of an undirected edge-weighted graph. If the graph is connected,