hdu 2544 最短路

单纯的 dijkstra就可以做。

#include <stdio.h>
#include <string.h>
int arcs[110][110];
int dist[110]; 
int visited[110],added;
int dijk(int N){
	int min = 0x7f7f7f7f;
	for(int i = 1;i <=N;++i){
		dist[i] = 0x7f7f7f7f;
	}
	for(int i = 2;i<=N;++i){
		if(arcs[1][i]){
			dist[i] = arcs[1][i];
		}
	}
	
	dist[1] = 0;
	visited[1] = 1;
	for(int i = 1;i <N;++i){
		min = 0x7f7f7f7f;
		for(int i = 1;i<=N;++i){
			if(!visited[i]&&dist[i] < min){min = dist[i];added = i;}
		}
		visited[added] = 1;
		for(int i = 1;i<=N;++i){
			if(!visited[i]&&dist[i] > dist[added] + arcs[added][i]&&arcs[added][i]){
				dist[i] = dist[added] + arcs[added][i];
			}
		}
	}
	return dist[N];
	
}

int main(int argc, char *argv[])
{
	//FILE *fp;	
	//fp = freopen("in.txt","r",stdin);
	
	int M,N;
	int x,y,weight;
	while(scanf("%d%d",&N,&M),N||M){
		memset(arcs,0,sizeof(arcs));
		for(int i = 0; i < M;++i){
			scanf("%d%d%d",&x,&y,&weight);
			arcs[x][y] = weight;
			arcs[y][x] = weight;
		}
		
		memset(visited,0,sizeof(visited));
		printf("%d\n",dijk(N));
	}
	return 0;
}