743. Network Delay Time

There are N network nodes, labelled 1 to N.

Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it takes for a signal to travel from source to target.

Now, we send a signal from a certain node K. How long will it take for all nodes to receive the signal? If it is impossible, return -1.

Note:
N will be in the range [1, 100].
K will be in the range [1, N].
The length of times will be in the range [1, 6000].
All edges times[i] = (u, v, w) will have 1 <= u, v <= N and 1 <= w <= 100.

迪杰斯特拉算法

#define MAX 101
class Solution {
    typedef struct Node {
        int d;
        int u;
        Node(int d1 = 0, int u1 = 0) {
            d = d1;
            u = u1;
        }
        bool operator < (const Node& n1) const {
            return d > n1.d;
        }
        bool operator > (const Node& n1) const {
            return d < n1.d;
        }
    }Node;
public:
    int networkDelayTime(vector<vector<int>>& times, int N, int K) {
        vector<Node> G[MAX];
        for (int i = 0; i < times.size(); i++) {
            Node n(times[i][2],times[i][1]);
            G[times[i][0]].push_back(n);
        }

        priority_queue<Node> Q;
        int dis[MAX];
        int pre[MAX];
        bool done[MAX];
        for (int i = 0; i < MAX; i++) {
            dis[i] = INT_MAX;
            done[i] = false;
            pre[i] = -1;
        }
        Node start(0,K);
        Q.push(start);
        dis[K] = 0;
        while (!Q.empty()){
            Node x = Q.top();
            Q.pop();
            if (done[x.u]) continue;
            done[x.u] = true;
            for (int i = 0; i < G[x.u].size(); i++) {
                Node to = G[x.u][i];
                if (dis[to.u] > to.d+dis[x.u]) {
                    dis[to.u] = to.d+dis[x.u];
                    pre[to.u] = x.u;
                    Node n(dis[to.u], to.u);
                    Q.push(n);
                }
            }
        }
        int max = 0;
        for (int i = 1; i <= N; i++) {
            if (dis[i] > max) max = dis[i];
        }
        if (max < INT_MAX) return max;
        return -1;
    }
};