Skip to content

Bellman Ford's Algorithm in c++ #244

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 40 additions & 0 deletions Graphs/BellmanFord.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
#include <iostream>
#include <vector>
#include <climits>

using namespace std;

#define INF 1e9

int main(){

int n,m,x,y,z;

cin >> n >> m; // n: number of vertex , m: number of edges

vector<vector<int> > edges(m+1,vector<int>());
vector<int> distances(n,INF);

for(int i=0;i<m;i++){
cin >> x >> y >> z;
edges[i].push_back(x);
edges[i].push_back(y);
edges[i].push_back(z);
}

distances[0] = 0;

for(int i=0;i<n-1;i++){
int j=0;
while(edges[j].size()!= 0){
if(distances[edges[j][0]]+edges[j][2]<distances[edges[j][1]]){
distances[edges[j][1]]=distances[edges[j][0]]+edges[j][2];
}
j++;
}
}

for(int i=0;i<n;i++)
cout << distances[i] << " ";
cout << endl;
}