1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#define MAXN 110
#define INF 0x3f3f3f3f
using namespace std;
int n, m;
long long dis[MAXN][MAXN];
void init()
{
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(i == j)
dis[i][j] = 0;
else
dis[i][j] = INF;
}
}
}
long long min(int a, int b)
{
return a < b ? a : b;
}
void floyd()
{
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
printf("%I64d\n", dis[1][n]);
}
int main()
{
int a, b, value;
while(scanf("%d%d", &n, &m) != EOF && n + m){
init();
for(int i = 0; i < m; i++){
scanf("%d%d%d", &a, &b, &value);
dis[a][b] = dis[b][a] = value;
}
floyd();
}
return 0;
}
|
