From 7ac231c1f7ea5b61a19e75936773a17c9442c4e2 Mon Sep 17 00:00:00 2001
From: drishtichouhan <drishti18@iitg.ac.in>
Date: Thu, 15 Oct 2020 13:00:54 +0530
Subject: [PATCH] Added the code of Djikstra algorithm to graphs folder

---
 .../Data Structure/Graph/djikstra.cpp         | 51 +++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 GeeksforGeeks/Data Structure/Graph/djikstra.cpp

diff --git a/GeeksforGeeks/Data Structure/Graph/djikstra.cpp b/GeeksforGeeks/Data Structure/Graph/djikstra.cpp
new file mode 100644
index 0000000..ec54860
--- /dev/null
+++ b/GeeksforGeeks/Data Structure/Graph/djikstra.cpp	
@@ -0,0 +1,51 @@
+#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;
+	vector<bool> sptset;
+	vector<int>dist;
+	for(int i=0;i<v;i++)
+	{
+		dist.push_back(INT_MAX);
+	}
+	dist[src]=0;
+	for(int i=0;i<v;i++)
+	{
+		sptset.push_back(false);
+	}
+	for(int count=0;count<(v-1);count++)
+	{
+		vector<int>:: iterator it = min_element(dist.begin(),dist.end());
+		int idx = it - dist.begin();
+		sptset[idx] = true;
+		
+		
+			
+			
+			for(int i = 0;i<adj[idx].size();i++)
+			{
+
+				int v = (adj[idx][i]).first;
+				int w = (adj[idx][i]).second;
+				if((sptset[v]==false) && dist[v]>dist[idx]+w)
+				{
+					dist[v] = dist[idx] + w;
+				}
+			}
+		
+
+	}
+	for(int i=0;i<v;i++)cout<<dist[i]<<' ';
+		cout<<endl;
+}
\ No newline at end of file