力扣（Dijkstra算法,Dijkstra+优先队列） 743. 网络延迟时间

class Solution {
public:
    int networkDelayTime(vector<vector<int>>& times, int N, int K) {
        vector<vector<int>> e(N+1,vector<int>(N+1,10000));
        for(int i = 0;i < times.size();i++){
            e[times[i][0]][times[i][1]] = times[i][2];
        }
        vector<int> dis(N+1,10000),vis(N+1,0);
        dis[K] = 0;
        for(int i = 0;i < N;i++){
            int flag = 0,minn = 10000;
            for(int j = 1;j <= N;j++){
                if(dis[j] < minn && vis[j] != 1){
                    minn = dis[j];
                    flag = j;
                }
            }
            vis[flag] = 1;
            for(int j = 1;j <= N;j++){
                if(dis[flag] + e[flag][j] < dis[j]){
                    dis[j] = dis[flag] + e[flag][j];
                }
            }
        }
        int res = 0;
        for(int j = 1;j <= N;j++){
            res = max(res,dis[j]);
        }
        if(res == 10000) return -1;
        return res;
    }
};

dijkstra+优先队列

class Solution {
public:
    int networkDelayTime(vector<vector<int>>& times, int N, int K) {
        vector<pair<int,int>> e[N+1];
        for(int i = 0;i < times.size();i++)
            e[times[i][0]].push_back({times[i][2],times[i][1]});
        vector<int> dis(N+1,100000),vis(N+1,0);
        dis[K] = 0;
        using Pair=pair<int,int>;
        priority_queue<Pair,vector<Pair>,greater<Pair>> q;//从小到大排序
        q.push({0,K});
        while(!q.empty()){
            auto [d,u] = q.top();
            q.pop();
            if(vis[u]) continue;
            vis[u] = 1;
            for(auto [d,v] : e[u]){
                dis[v] = min(dis[v],dis[u]+d);
                if(!vis[v]) q.push({dis[v],v});
            }
        }
        int maxn = 0;
        for(int i = 1;i <= N;i++){
            maxn = max(dis[i],maxn);
        }
        if(maxn == 100000) return -1;
        return maxn;
    }
};