还是畅通工程 hdu1233 Prim

http://acm.hdu.edu.cn/showproblem.php?pid=1233

很久不写代码。敲一道最小生成树。赤裸裸的最小生成树。

#include <iostream>
using namespace std;
#define N 105
#define MAX 0x7ffffff
int map[N][N],dir[N];
bool visited[N];

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
#endif
	int n,i,j,a,b,c,path,t,low;
	while (scanf("%d",&n)!=EOF&&n){
		for (i=0;i<=n;i++){
			visited[i]=false;
			dir[i]=0;
			for (j=0;j<=n;j++)
				map[i][j]=MAX;
		}
		for (i=0;i<n*(n-1)/2;i++){
			scanf("%d%d%d",&a,&b,&c);
			map[a][b]=map[b][a]=c;
		}
		dir[1]=0;
		visited[1]=true;
		path=0;
		for (i=2;i<=n;i++)
			dir[i]=map[1][i];
		for (i=2;i<=n;i++){
			low=MAX;
			for (j=1;j<=n;j++)
				if (!visited[j]&&dir[j]<low){
					low=dir[j];
					t=j;
				}
			visited[t]=true;
			path+=low;
			for (j=1;j<=n;j++)
				if (!visited[j]&&map[j][t]<dir[j])
					dir[j]=map[j][t];
		}
		printf("%d\n",path);
	}
}