-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBellman_Ford.cpp
110 lines (103 loc) · 2.43 KB
/
Bellman_Ford.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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
////#include"bits/stdc++.h"
////using namespace std;
////
////int main(){
//// int v,e;
//// cin>>v>>e;
////
//// vector<vector<pair<int,int>>> graph(v+1);
////
//// vector<pair<int,pair<int,int>>> p;
////
//// for(int i=0;i<e;i++){
//// int x,y,w;
//// cin>>x>>y>>w;
//// graph[x].push_back({y,w});
//// p.push_back({w,{x,y}});
//// }
////
//// vector<int> dis(v+1,INT_MAX/2);
//// dis[0]=0; //setting staring node's distance = 0
////
//// for(int i=0;i<v-1;i++){
//// for(auto it:p){
//// int x=it.second.first; // source node
//// int y=it.second.second; // destination node
//// int w=it.first; // weight
//// if(dis[x]!=INT_MAX && dis[x]+w<dis[y])
//// dis[y]=dis[x]+w;
//// }
//// }
////
//// for(int i=1;i<=v;i++){
//// cout<<dis[i]<<" ";
//// }
////}
//
//
//
//#include<bits/stdc++.h>
//using namespace std;
//
//int main()
//{
// int v,e;cin>>v>>e;
// vector<vector<pair<int,int>>>graph(v+1);
// vector<pair<int,pair<int,int>>>p;
//
// for(int i=0;i<e;++i)
// {
// int x,y,w;cin>>x>>y>>w;
// graph[x].push_back({y,w});
// p.push_back({w,{x,y}});
// }
// vector<int>dis(v+1,INT_MAX/2);
// dis[0]=0;
// for(int i=0;i<v-1;++i)
// {
// for(auto it: p)
// {
// int x=it.second.first;
// int y=it.second.second;
// int w=it.first;
//
// if(dis[x]!=INT_MAX and dis[x]+w<dis[y])
// {
// dis[w]=dis[x]+w;
// }
// }
//
// for(int i=1;i<=e;++i)
// {
// cout<<dis[i]<<" ";
// }
// }
//}
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,e;
cin>>v>>e;
vector<vector<pair<int,int>>>graph(v+1);
vector<pair<int,pair<int,int>>>p;
for(int i=0;i<e;++i)
{
int x,y,w;cin>>x>>y>>w;
graph[x].push_back({y,w});
p.push_back({w,{x,y}});
}
vector<int>dis(v+1,INT_MAX/2);
dis[0]=0;
for(int i=0;i<v-1;++i)
{
for(auto it : p)
{
int x=it.second.first;
int y=it.second.second;
int w=it.first;
if(dis[x]!=INT_MAX/2 and dis[x]+w<dis[y]){dis[w]=dis[x]+w;}
}
for(int i=1;i<=e;++i){cout<<dis[i]<<" ";}
}
}