From c9c7c75e52acf188d88ea7d0b180d67f83e88166 Mon Sep 17 00:00:00 2001
From: Rishabh Kumar <52632726+rishabhk965@users.noreply.github.com>
Date: Wed, 13 Oct 2021 14:49:56 +0530
Subject: [PATCH] added bellmanford.cpp

---
 dynamic_programming/bellmanford.cpp | 53 +++++++++++++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 dynamic_programming/bellmanford.cpp

diff --git a/dynamic_programming/bellmanford.cpp b/dynamic_programming/bellmanford.cpp
new file mode 100644
index 00000000..7f980020
--- /dev/null
+++ b/dynamic_programming/bellmanford.cpp
@@ -0,0 +1,53 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int v,e;
+	cin>>v>>e;
+	vector< pair<int,int> > adj[v];
+	for(int i=0;i<e;i++)
+	{
+		int src,dest,w;
+		cin>>src>>dest>>w;
+		adj[src].push_back({dest,w});
+	}
+	int src;
+	cin>>src;
+	int dist[v];
+	for(int i=0;i<v;i++)dist[i]=INT_MAX;
+	dist[src]=0;
+	for(int i=0;i<(v-1);i++)
+	{
+		for(int j=0;j<v;j++)
+		{
+			for(int k=0;k<adj[j].size();k++)
+			{
+				int s,d,w;
+				s = j;
+				d = adj[j][k].first;
+				w =  adj[j][k].second;
+				if(dist[d]>(dist[s]+w) && dist[s]!=INT_MAX)
+				{
+					dist[d] = dist[s] + w;
+				}
+			}
+		}
+	}
+	bool x=true;
+	for(int j=0;j<v;j++)
+	{
+		for(int k=0;k<adj[j].size();k++)
+		{
+			int s,d,w;
+			s = j;
+			d = adj[j][k].first;
+			w =  adj[j][k].second;
+			if(dist[d]>dist[s]+w && dist[s]!=INT_MAX)
+			{
+				x = false;
+			}
+		}
+	}
+	for(int i=0;i<v;i++)cout<<dist[i]<<' ';
+	cout<<endl;
+}
\ No newline at end of file