POJ - 2387 Til the Cows Come Home

#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<stack>
#include<sstream>
#include<assert.h>
#include<vector>
#include<cstdio>
#include<string>
#include<map>
#include<iostream>
#include<algorithm> 
#include<vector>
using namespace std;
#define INF 0x3f3f3f3f


int m, n, w[2005][2005], d[2005], vis[2005];
void Dijkstra() {
	memset(vis, 0, sizeof(vis));
	memset(d, 0x3f, sizeof(d));
	d[0] = 0;
	for(int i = 0;i < n;i++){
		int x = 0, temp = INF;
		for (int j = 0; j < n; j++) 
			if (!vis[j] && d[j] < temp) 
				temp = d[x = j];
		vis[x] = 1;
		for (int j = 0; j < n; j++) {
			if(!vis[j])
				d[j] = min(d[j], d[x] + w[x][j]);
		}
	}
}
int main() {
	while (cin >> m >> n) {
		memset(w, 0x3f, sizeof(w));
		for (int i = 0; i < m; i++) {
			int a, b, c;
			cin >> a >> b >> c;
			w[a - 1][b - 1] = min(w[a - 1][b - 1], c);
			w[b - 1][a - 1] = w[a - 1][b - 1];
		}
		Dijkstra();
		cout << d[n - 1] << endl;
	}
	return 0;
}