最短路 hdu-2544

floyd:
O(N^3)

#include<cstdio>
#include<cstring>
#define min(a, b) (a < b ? a : b)

const int N = 110;
int n, m, g[N][N], a, b, c;

void floyd() {
	for(int k = 1; k <= n; k++) {
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
			}
		}
	}
}

int main() {
	while(scanf("%d%d", &n, &m) && n && m) {
		memset(g, 0x3f, sizeof(g));
		for(int i = 1; i <= n; i++) g[i][i] = 0;
		for(int i = 1; i <= m; i++) {
			scanf("%d%d%d", &a, &b, &c);
			g[a][b] = g[b][a] = min(g[a][b], c);
		}
		floyd();
		printf("%d\n", g[1][n]);
	}
	return 0;
}

朴素版dijkstra
O(N^2)

#include<cstdio>
#include<cstring>
#define min(a, b) (a < b ? a : b)

const int N = 110;
int n, m, g[N][N], a, b, c, d[N];
bool vis[N];

void dijkstra() {
	memset(d, 0x3f, sizeof(d));
	memset(vis, false, sizeof(vis));
	d[1] = 0;
	while(1) {
		int v = -1;
		for(int i = 1; i <= n; i++) {
			if(!vis[i] && (v== -1 || d[i] < d[v])) v = i;
		}
		if(v == -1) break;
		vis[v] = true;
		for(int i = 1; i <= n; i++) {
			d[i] = min(d[i], d[v] + g[v][i]);
		}
	}
}

int main() {
	while(scanf("%d%d", &n, &m) && n && m) {
		memset(g, 0x3f, sizeof(g));
		for(int i = 1; i <= n; i++) g[i][i] = 0;
		for(int i = 1; i <= m; i++) {
			scanf("%d%d%d", &a, &b, &c);
			g[a][b] = g[b][a] = min(g[a][b], c);
		}
		dijkstra();
		printf("%d\n", d[n]);
	}
	return 0;
}