最小生成树 prime poj1287

poj1287 裸最小生成树

代码

 #include "map"
 #include "queue"
 #include "math.h"
 #include "stdio.h"
 #include "string.h"
 #include "iostream"
 #include "algorithm"
 #define abs(x) x > 0 ? x : -x
 #define max(a,b) a > b ? a : b
 #define min(a,b) a < b ? a : b

 using namespace std;

 int arc[][];

 void Prime(int n){
     int i,j,k,m;
     int sumweight = ;
     int addnew[];
     int lowcost[];
     for(i=; i<=n; i++){
         addnew[i] = ;
         lowcost[i] = arc[][i];
     }
     addnew[] = ;
     for(i=; i<n; i++){
         k = ,m = ;
         for(j=; j<=n; j++){
             if(!addnew[j] && lowcost[j]<m){
                 m = lowcost[j];
                 k = j;
             }
         }
         sumweight += lowcost[k];
         addnew[k] = ;
         for(j=; j<=n; j++){
             if(!addnew[j] && arc[k][j]<lowcost[j])
                 lowcost[j] = arc[k][j];
         }
     }
     printf("%d\n",sumweight);
 }

 int main(){
     int n,m,i,a,b,c;
     while(scanf("%d",&n)&&n){
         memset(arc,,sizeof(arc));
         scanf("%d",&m);
         while(m--){
             scanf("%d%d%d",&a,&b,&c);
             if(arc[a][b]>c){
                 arc[a][b] = c;
                 arc[b][a] = c;
             }
         }
         Prime(n);
     }
     return ;
 }