<ul><li>Kruskal’s algorithm is used to find MST in a graph. It is a greedy based algorithm.</li><li>The graph should be connected, undirected, and weighted for Kruskal’s algorithm to work.</li><li>The working of Kruskal’s algorithm involves sorting edges, connecting edges with the smallest weight, checking for cycles, and repeating until all vertices are connected.</li><li>An example is provided to illustrate the steps of Kruskal’s algorithm, and an implementation of the algorithm in C++ is included.</li></ul>

Minimum Spanning Tree tutorial 2: Introduction to Kruskal’s algorithm

Discover more