dijkstra.cpp

// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;

// } Driver Code Ends
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 source)
    {
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
        pq.push({0, source}); // <distance, node>

        vector<int> dist(V, INT_MAX);
        dist[source] = 0;

        while (!pq.empty()) {
            int node = pq.top().second;
            int dt = pq.top().first;
            pq.pop();

            for (auto ele : adj[node]) {
                int adjNode = ele[0];
                int adjdt = ele[1];
                cout << adjdt << "  " << adjNode << "  " << dt << "  " << node << endl;
                if (adjdt + dt < dist[adjNode]) {
                    dist[node] = adjdt + dt;
                    pq.push({adjdt + dt, adjNode});
                }
            }
        }
        return dist;
    }
};


// { Driver Code Starts.


int main()
{
    int t;
    cin >> t;
    while (t--) {
        int V, E;
        cin >> V >> E;
        vector<vector<int>> adj[V];
        int i = 0;
        while (i++ < E) {
            int u, v, w;
            cin >> u >> v >> w;
            vector<int> t1, t2;
            t1.push_back(v);
            t1.push_back(w);
            adj[u].push_back(t1);
            t2.push_back(u);
            t2.push_back(w);
            adj[v].push_back(t2);
        }
        int S;
        cin >> S;

        Solution obj;
        vector<int> res = obj.dijkstra(V, adj, S);

        for (int i = 0; i < V; i++)
            cout << res[i] << " ";
        cout << endl;
    }

    return 0;
}

// } Driver Code Ends