Minimum Spanning Tree by kruskal

Algorithm Name: Kruskal
Algorithm Category:  Graph search algorithm

Source Code:
////////////////////////////////////////////// // Bismillahir Rahmanir Rahim // // Author : Shohan Ahmed Sijan // // Country : Bangladesh // // University : East West University // ///////////////////////////////////////// #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <algorithm> #include <iostream> using namespace std; #define N 1000 int i,node,tedge,leader[N]; struct st { int x,y,cost; }edge[N]; bool cmp(st a,st b) { return a.cost<b.cost; } int Leader(int X) { if(leader[X]==-1)return X; return leader[X]=Leader(leader[X]); } int main() { printf("How many node: "),scanf("%d",&node); printf("How many edge: "),scanf("%d",&tedge); printf("X Y Cost 1<=x,y<=n\n"); for(i=0;i<tedge;i++) scanf("%d %d %d",&edge[i].x,&edge[i].y,&edge[i].cost); sort(edge,edge+tedge,cmp); for(i=1;i<=node;i++) leader[i]=-1; int x1,y1,mincost=0,chose=0,cnt=0; printf("Edge for kruskal is:\n"); for(i=0;i<tedge && chose<node-1 ;i++) { x1=Leader(edge[i].x); y1=Leader(edge[i].y); if(x1!=y1) { printf("%3d %3d %3d\n",edge[i].x,edge[i].y,edge[i].cost); mincost+=edge[i].cost; leader[x1]=y1; chose++; } } for(i=1;i<=node;i++) if(leader[i]==-1) cnt++; if(cnt==1)printf("Lowest cost is %d\n",mincost); else printf("Not connected\n"); return 0; }

Input:
5 7 1 2 3 2 3 2 1 5 7 5 4 2 3 4 5 1 4 4 3 5 4

Output:
5 How many node: 5 How many edge: 7 X Y Cost 1<=x,y<=n 1 2 3 2 3 2 1 5 7 5 4 2 3 4 5 1 4 4 3 5 4 Edge for kruskal is: 2 3 2 5 4 2 1 2 3 1 4 4 Lowest cost is 11