c program for prims algorithm

1#include<stdio.h>
2#include<conio.h>
3int a,b,u,v,n,i,j,ne=1;
4int visited[10]= {	0},min,mincost=0,cost[10][10];
5void main() {	
6clrscr();	
7printf("\n Enter the number of nodes:");	
8scanf("%d",&n);	
9printf("\n Enter the adjacency matrix:\n");	
10for (i=1;i<=n;i++)	  
11    for (j=1;j<=n;j++) {		
12      scanf("%d",&cost[i][j]);		
13      if(cost[i][j]==0)		    
14      cost[i][j]=999;	
15      }	
16    visited[1]=1;	
17    printf("\n");	
18    while(ne<n) {		
19      for (i=1,min=999;i<=n;i++)		  
20        for (j=1;j<=n;j++)		    
21          if(cost[i][j]<min)		     
22          if(visited[i]!=0) {			
23          min=cost[i][j];			
24          a=u=i;			
25          b=v=j;		
26          }		
27          if(visited[u]==0 || visited[v]==0) 
28          {			
29            printf("\n Edge %d:(%d %d) cost:%d",ne++,a,b,min);
30            mincost+=min;			
31            visited[b]=1;		
32            }		
33          cost[a][b]=cost[b][a]=999;	
34          }	
35          printf("\n Minimun cost=%d",mincost);
36          getch();
37}