From 1b46a4dd32d583fe07a67a3605c6255426d6d2de Mon Sep 17 00:00:00 2001
From: Satyam Goel <64177535+hunt-s7@users.noreply.github.com>
Date: Tue, 5 Oct 2021 18:40:00 +0530
Subject: [PATCH] Added shortest path algorithm "Dijkastra's Algorithm"

---
 dijkastra.cpp | 61 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 dijkastra.cpp

diff --git a/dijkastra.cpp b/dijkastra.cpp
new file mode 100644
index 000000000..795be646b
--- /dev/null
+++ b/dijkastra.cpp
@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+vector<int> dijkastra(vector<int> g[],int src,int V)
+{
+    vector<int> dist(V,INT_MAX);
+    dist[src]=0;
+
+    vector<bool> fin(V,false);
+
+    for(int count=0;count<V-1;count++)
+    {
+        int u=-1;
+        for(int i=0;i<V;i++)
+        {
+            if(fin[i]!=true && (u==-1||dist[i]<dist[u]))
+            u=i;
+        }
+        fin[u]=true;
+        for(int v=0;v<V;v++)
+        {
+            if(g[u][v]!=0 && fin[v]==false)
+            {
+                dist[v]=min(g[u][v]+dist[u] , dist[v]);
+            }
+        }
+    }
+    return dist;
+}
+
+int main()
+{
+
+#ifndef ONLINE_JUDGE
+freopen("input.txt","r",stdin);
+freopen("output.txt","w",stdout);
+#endif
+    int n;
+    cin>>n;
+
+    int src;
+    cin>>src;
+
+    vector<int> g[n];
+
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<n;j++)
+        {
+            int x;
+            cin>>x;
+            g[i].push_back(x);
+        }
+    }
+    
+    vector<int> dist(n);
+    dist=dijkastra(g,src,n);
+
+    for(int i=0;i<n;i++)
+    cout<<dist[i]<<" ";
+}
\ No newline at end of file