Find minimum spanning tree using kruskal algorith in c Language
#include <stdio.h> int find(int i, int parent[]) { while (parent[i] != i) i = parent[i]; return i; } void union_set(int i, int j, int parent[]) { int a = find(i, parent); int b = find(j, parent); parent[b] = a; } void kruskal(int n, int edges[20][3], int e) { int parent[20]; int i, j, u, v, cost = 0, count = 0; // Step 1: MakeSet(v) → initialize parent[i] = i for (i = 1; i <= n; i++) parent[i] = i; // Step 2: Sort edges in ascending order of weight for (i = 0; i < e - 1; i++) { for (j = i + 1; j < e; j++) { if (edges[i][2] > edges[j][2]) { int temp0 = edges[i][0]; int temp1 = ed...