| 16 | */ |
| 17 | |
| 18 | bool relax(int u, int v, int w, vector <int> &dist) { |
| 19 | |
| 20 | // both vertices u and v are not visited from bellman source |
| 21 | if (dist[u] == INT_MAX && dist[v] == INT_MAX) { |
| 22 | return false; |
| 23 | } |
| 24 | |
| 25 | if (dist[v] > dist[u] + w) { |
| 26 | dist[v] = dist[u] + w; |
| 27 | return true; |
| 28 | } |
| 29 | return false; |
| 30 | } |
| 31 | |
| 32 | /* Bellman ford function to check negative cycle |
| 33 | * v = no. of verties |