Create Dijkstra.cpp

Graph/Dijkstra.cpp

@@ -0,0 +1,32 @@
+#include<bits/stdc++.h>
+using namespace std;
+vector < pair <int,int> > graph[5*100001];
+int m,n,l,x,y;
+int dis[5*100001];
+int dij(vector <pair<int,int> > * v,int s,int * dis) {
+    priority_queue < pair <int,int> , vector < pair <int,int> >,greater < pair <int,int> > > pq;
+    pq.push(make_pair(0,s));
+    dis[s] = 0;
+    int u;
+    while(!pq.empty()) {
+
+        u = (pq.top()).second;
+        pq.pop();
+        for( vector <pair <int,int> > :: iterator it = v[u].begin(); it != v[u].end();it++) {
+            if(dis[u] + it->first < dis[it->second]) {
+                dis[it->second] = dis[u] + it->first;
+                pq.push(make_pair(dis[it->second],it->second));
+            }
+        }
+    }
+}
+int main() {
+    cin>>n>>m;
+    for(int i = 0;i < m;i++) {
+        scanf("%d%d%d",&x,&y,&l);
+        graph[x].push_back(make_pair(l,y));
+        graph[y].push_back(make_pair(l,x));
+    }
+    dij(graph,1,dis);
+   
+}