Discuss Kruskal's algorithm 

Kruskal's Algorithm is a popular algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. An MST is a subset of edges that connects all vertices together with the minimum possible total edge weight and without any cycles. Kruskal’s algorithm is particularly well-suited for edge-centric problems and operates efficiently on sparse graphs.