744. Network Delay Time

744. 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:

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

Analyze:
从题目上分析，很容易得到这个问题其实是个单源出发的最短路径问题，我在这里采用的Dijkstra算法解决的问题。

Code:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>

using namespace std;

class Solution {
public:
    struct Compare {
        bool operator()(const pair<int, int> &l, const pair<int, int> &r) const {
            return l.second > r.second;
        }
    };

    int networkDelayTime(vector<vector<int>>& times, int N, int K) {
        vector<vector<pair<int, int>>> graph(N + 1, vector<pair<int, int>>());
        priority_queue<pair<int, int>, vector<pair<int, int>>, Compare> pq;
        for (auto &v : times)
            graph[v[0]].push_back(make_pair(v[1], v[2]));
        pq.push(make_pair(K, 0));
        vector<int> weights(N + 1, INT_MAX);
        weights[K] = 0;
        while (!pq.empty()) {
            pair<int,int> current = pq.top();
            pq.pop();
            for (auto &p : graph[current.first]) {
                int new_weight = current.second + p.second;
                if (weights[p.first] > new_weight) {
                    weights[p.first] = new_weight;
                    pq.push(make_pair(p.first, new_weight));
                }
            }
        }

        int res = 0;
        for (int i = 1; i < N + 1; ++i) {
            if (weights[i] == INT_MAX) return -1;
            res = max(res, weights[i]);
        }
        return res;
    }
};