prim最小生成树模板

int minTree(int n){int i,j;memset(v,0,sizeof(v));v[0]=1;sum=0;for(i=1;i<n;i++){min=max;for(j=0;j<n;j++){if(!v[j]&&map[0][j]<min){min=map[0][j];flag=j;}}sum+=min;v[flag]=1;for(j=0;j<n;j++){if(!v[j]&&map[0][j]>map[flag][j]){map[0][j]=map[flag][j];}}}return sum;}