HDU 1233 还是畅通工程（prim）

题意：

求最小生成树，注意未给距离的点之间的距离要设置为无穷大。

#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<queue>#include<cstring>using namespace std;const int N=105;#define inf 0x3f3f3f3fint ma[N][N],vis[N],dis[N],cost;int n;void prim(){for(int i=1;i<=n;i++){dis[i]=ma[1][i];vis[i]=0;}dis[1]=0;vis[1]=1;for(int i=1;i<=n;i++){int mi=inf,mb=0;for(int j=1;j<=n;j++){if(!vis[j]&&dis[j]<mi){mi=dis[j];mb=j;}}if(mi==inf) break;vis[mb]=1;cost+=dis[mb];for(int i=1;i<=n;i++){if(!vis[i]&&ma[mb][i]<dis[i]){dis[i]=ma[mb][i];}}}}int main(){while(scanf("%d",&n)&&n){cost=0;int te=n*(n-1)/2;int a,b,c;memset(ma,0x3f3f3f3f,sizeof(ma));for(int i=1;i<=te;i++){scanf("%d%d%d",&a,&b,&c);ma[b][a]=ma[a][b]=c;}prim(); //cout<<cost<<endl;printf("%d\n",cost);}return 0;}