How Kruskal’s algorithm works?
Kruskal is a greedy algorithm which works on the idea of removing the global minimum cost edge from the given graph which should not be forming a cycle, which finally leads us to a minimum spanning tree.
For a deeper understanding, please refer to this video.