The purpose behind Krushal’s algorithm is to find a minimum spanning forest of an undirected edge-weighted graph. For instance, if the graph is connected, it will find a minimum spanning tree. Now, a Minimum Spanning Tree or MST in Krushal’s ...