-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbellmanford.cpp
77 lines (70 loc) · 1.5 KB
/
bellmanford.cpp
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
75
76
77
#include <bits/stdc++.h>
using namespace std;
int n;
int arr[4];
void findWeight(int i, int root, int n, int target, int prevWeight, int tempWeight, vector<vector<int>> vec)
{
int weight = prevWeight;
for (int j = 0; j < n; j++)
{
if (vec[i][j] != 0)
{
weight += vec[i][j];
if (j == target)
{
if (arr[j] > weight)
{
arr[j] = weight;
}
weight = tempWeight;
}
else if (j != root)
{
findWeight(j, root, n, target, weight, tempWeight, vec);
weight = tempWeight;
}
}
}
}
int main()
{
int m;
cin >> n >> m;
vector<vector<int>> vec(n, vector<int>(n));
for (int i = 0, u, v, w; i < m; i++)
{
cin >> u >> v >> w;
vec[u][v] = w;
}
arr[0] = 0;
for (int i = 1; i < n; i++)
{
if (vec[0][i] != 0)
arr[i] = vec[0][i];
else
arr[i] = 100;
}
int weight;
for (int k = 1; k < n; k++)
{
for (int i = 1; i < n; i++)
{
if (vec[0][i] != 0)
{
weight = vec[0][i];
findWeight(i, i, n, k, weight, weight, vec);
}
}
}
for (int i = 0; i < n; i++)
{
if (arr[i] == 100)
{
cout << -1 << " ";
}
else
{
cout << arr[i] << " ";
}
}
}