To implement prim’s algorithm to generate a min-cost spanning tree.

#include
#include
int a,b,u,v,n,i,j,ne=1;
int visited[10]={0},min,mincost=0,cost[10][10];

void main()
{
    clrscr();
    cout > n;
    cout > cost[i][j];
    if( cost[i][j]==0 )
       cost[i][j] = 999;
    }  // where is the starting brace ???

    visited[1]=1;
    cout << "\n";
    while( ne < n )
    {
        for( i=1, min=999; i <= n; i++ )
            for( j=1; j <= n; j++ )
                if( cost[i][j] < min )
                    if( visited[i] != 0 )
                    {
                        min=cost[i][j];
                        a=u=i;
                        b=v=j;
                    }

        if( visited[u] == 0 || visited[v] == 0 )
        {
            cout << "\n Edge: " << ne++ << "(" << a << "," << b << ") cost: " << min;
            mincost += min;
            visited[b] = 1;
        }
        cost[a][b] = cost[b][a] = 999;
    }
    cout << "\n Minimun cost= " << mincost;
    getch();
}