This is the implementation of Kruskal’s Algorithm in C Programming Language.This algorithm is directly based on the generic MST (Minimum Spanning Tree) algorithm. Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

Pseudocode For The Kruskal’s Algorithm

 C Language Implementation