-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdijkstran.c
More file actions
60 lines (49 loc) · 1.11 KB
/
Copy pathdijkstran.c
File metadata and controls
60 lines (49 loc) · 1.11 KB
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
56
57
58
59
60
#include <stdio.h>
#define inf 99999999
int main()
{
int e[10][10],dis[10],book[10],i,j,n,m,t1,t2,t3,u,v,min;
scanf("%d %d", &n, &m);
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(i == j) e[i][j] = 0;
else e[i][j] = inf;
for(i=1; i<=m; i++)
{
scanf("%d %d %d", &t1, &t2, &t3);
e[t1][t2] = t3;
}
for(i=1; i<=n; i++)
{
dis[i] = e[1][i];
book[i] = 0;
}
book[1] = 1;
//Dijkstran算法核心
for(i=1; i<=n-1; i++)
{
min = inf;
for(j=1; j<=n; j++)
{
if(book[j] == 0 && dis[j]<min)
{
// book[j] = 1;
min = dis[j];
u = j;
}
}
book[u] = 1;
// 松弛步骤
for(v=1; v<=n; v++)
{
if(e[u][v] < inf)
{
if(dis[v] > dis[u] + e[u][v])
dis[v] = dis[u] + e[u][v];
}
}
}
for(i=1; i<=n; i++)
printf("%d ", dis[i]);
return 0;
}