C program to implement Kruskal algorithm

Kruskal’s algorithm is a greedy algorithm that finds the minimum spanning tree of a graph. Graph should be weighted, connected, and undirected. Minimum spanning tree is a spanning tree with weight less than or equal to the weight of every other spanning tree. 

Example of C program to implement Kruskal algorithm.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

int i,j,k,a,b,u,v,n,ne=1;
int min,mincost=0,cost[9][9],parent[9];
int find(int);
int uni(int,int);

void main()
{
 clrscr();
 printf("nntImplementation of Kruskal's algorithmnn");
 printf("nEnter the no. of verticesn");
 scanf("%d",&n);
 printf("nEnter the cost adjacency matrixn");
 for(i=1;i<=n;i++)
 {
  for(j=1;j<=n;j++)
  {
   scanf("%d",&cost[i][j]);
   if(cost[i][j]==0)
   cost[i][j]=999;
  }
 }
 printf("nThe edges of Minimum Cost Spanning Tree arenn");
 while(ne<n)
 {
  for(i=1,min=999;i<=n;i++)
  {
   for(j=1;j<=n;j++)
   {
    if(cost[i][j]<min)
    {
     min=cost[i][j];
     a=u=i;
     b=v=j;
    }
   }
  }
  u=find(u);
  v=find(v);
  if(uni(u,v))
  {
   printf("n%d edge (%d,%d) =%dn",ne++,a,b,min);
   mincost +=min;
  }
  cost[a][b]=cost[b][a]=999;
 }
 printf("ntMinimum cost = %dn",mincost);
 getch();
}

int find(int i)
{
 while(parent[i])
 i=parent[i];
 return i;
}

int uni(int i,int j)
{
 if(i!=j)
 {
 parent[j]=i;
 return 1;
 }
 return 0;
}