-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbellmanFordQue.c
More file actions
74 lines (57 loc) · 1.32 KB
/
Copy pathbellmanFordQue.c
File metadata and controls
74 lines (57 loc) · 1.32 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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <stdio.h>
#define inf 99999999
int main()
{
int n,m,i,j,k;
// 邻接表
int u[8],v[8],w[8];
int first[6],next[8];
int dis[6] = {0}, book[6] = {0};
// 队列结构
int que[101] = {0}, head=1, tail=1;
scanf("%d %d", &n, &m);
// 最短距离表初始化
for(i=1; i<=n; i++)
dis[i] = inf;
dis[1] = 0;
for(i=1; i<=n; i++)
book[i] = 0;
// 初始化first数组
for(i=1; i<=n; i++)
first[i] = -1;
for(i=1; i<=m; i++)
{
scanf("%d %d %d", &u[i], &v[i], &w[i]);
next[i] = first[u[i]];
first[u[i]] = i;
}
que[tail] = 1;
tail++;
book[1] = 1;
while(head<tail)
{
//当前需要处理的队首顶点
k = first[que[head]];
while(k != -1)
{
if(dis[v[k]] > dis[u[k]] + w[k] )
{
dis[v[k]] = dis[u[k]] + w[k];
if(book[v[k]] == 0)
{
que[tail] = v[k];
tail++;
book[v[k]] = 1;
}
}
k = next[k];
}
book[que[head]] = 0;
head++;
}
for(i=1; i<=n; i++)
{
printf("%d ", dis[i]);
}
return 0;
}