Kruskal's Algorithm Kruskal's algorithm is used to find the minimum spanning tree (MST) of a connected, undirected graph. It was developed by Joseph Kruskal in 1956. The algorithm operates by sorting all the edges of the graph by their weights and then adding the shortest edges to the growing spanning tree without forming a cycle until the tree spans all the vertices. What is Kruskal's Algorithm? Kruskal's Algorithm is a classic algorithm in the graph theory used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. The MST of the graph is a subset of its edges that connects all the vertices together, without any cycles and with the minimum possible total edge weight. In Kruskal's algorithm, we sort all edges of the given graph in increasing order. Then it keeps on adding new edges and nodes in the MST if the newly added edge does not form a cycle. It picks the minimum weighted edge at first and the maximum weighted edge at last. This article will discuss few important facts associated with minimum spanning trees, and then will give the simplest implementation of Kruskal's algorithm for finding minimum spanning tree.
