Create DijkstraUsingPQ.cpp

Graphs/DijkstraUsingPQ.cpp

@@ -0,0 +1,30 @@
+class Solution
+{
+	public:
+	//Function to find the shortest distance of all the vertices
+    //from the source vertex S.
+    vector <int> dijkstra(int V, vector<vector<int>> adj[], int S)
+    {
+        // Code her
+        priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
+        vector<int>dist(V,1e9);
+        dist[S]=0;
+
+        // {dist,node}
+        pq.push({0,S});
+       while(!pq.empty()){
+           int dis=pq.top().first;
+           int node=pq.top().second;
+           pq.pop();
+           for(auto it:adj[node]){
+               int edgeW=it[1];
+               int adjNode=it[0];
+               if(dis+edgeW<dist[adjNode]){
+                   dist[adjNode]=dis+edgeW;
+                   pq.push({dist[adjNode],adjNode});
+               }
+           }
+       }
+       return dist;
+    }
+};