1514. Path with Maximum Probability

class Solution {
public:
    double maxProbability(int n, vector<vector<int>>& edges, vector<double>& succProb, int start, int end) {
        vector<pair<int,double>>adj[n]; //Creating adjacency list
        for(int i=0;i<edges.size();i++){
            adj[edges[i][0]].push_back({edges[i][1],succProb[i]});
            adj[edges[i][1]].push_back({edges[i][0],succProb[i]});
        }
        priority_queue<pair<double,int>>pq; //Use maxHeap for path with the maximum probability
        pq.push({1.0,start}); //{probability,node}
        vector<double>dist(n,INT_MIN);
        dist[start]=1;
        while(!pq.empty()){
            auto itr=pq.top();
            pq.pop();
            double dis=itr.first;
            int node=itr.second;
            for(auto it:adj[node]){
                int adjNode=it.first;
                double edW=it.second;
                if(dist[adjNode]<dis*edW){ //If greater probability is found then update probability of adjacent node & push adjacent node in maxHeap
                    dist[adjNode]=dis*edW;
                    pq.push({dist[adjNode],adjNode});
                }
            }
        }        
        if(dist[end]==INT_MIN) return 0.00000; //If there is no path from start to end
        else return dist[end];
    }
};