Prime算法实现

int MAX;
int dist[MAX],map[MAX][MAX];
bool visited[MAX];
void prime()
{
    int i,j,min,locate;
    memset(visited,false,sizeof(visited));
    for(i=1;i<=n;i++)
        dist[i]=map[1][i];

    visited[1]=true;
    
    for(i=1;i<n;i++)
    {
        min=INF;
        for(j=1;j<=n;j++)
        {
            if(!visited[j]&&dist[j]<min)
            {
                min=dist[j];
                locate=j;
            }
        }
        sum+=min;
        visited[locate]=1;
        for(j=1;j<=n;j++)
        {
            if(!visited[j]&&dist[j]>map[locate][j])
            {
                dist[j]=map[locate][j];
            }
        }
    }
}