CPMagical CP Library

Problem solution · C++

Network Delay Time

Network Delay Time: a C++ solution using heap or priority queue. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Heap or priority queue
Source
walkccc LeetCode Solutions
Length
41 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Heap or priority queue

For Network Delay Time, the implementation repeatedly takes the currently best candidate from a heap while inserting newly available choices.

  1. Define the priority key and whether the smallest or largest item should lead.
  2. Push each candidate when it becomes eligible.
  3. Discard stale entries when necessary and process the best live candidate.

Code notes

  • 41 lines of C++ from the credited upstream file 743.cpp.
  • The implementation visibly relies on sequence storage, work queue.
  • 3 loop blocks detected.

Complexity

Count heap pushes and pops; each normally contributes a logarithmic factor in the heap size.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeNetwork Delay Time · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  int networkDelayTime(vector<vector<int>>& times, int n, int k) {    vector<vector<pair<int, int>>> graph(n);     for (const vector<int>& time : times) {      const int u = time[0] - 1;      const int v = time[1] - 1;      const int w = time[2];      graph[u].emplace_back(v, w);    }     return dijkstra(graph, k - 1);  }  private:  int dijkstra(const vector<vector<pair<int, int>>>& graph, int src) {    vector<int> dist(graph.size(), INT_MAX);     dist[src] = 0;    using P = pair<int, int>;  // (d, u)    priority_queue<P, vector<P>, greater<>> minHeap;    minHeap.emplace(dist[src], src);     while (!minHeap.empty()) {      const auto [d, u] = minHeap.top();      minHeap.pop();      if (d > dist[u])        continue;      for (const auto& [v, w] : graph[u])        if (d + w < dist[v]) {          dist[v] = d + w;          minHeap.emplace(dist[v], v);        }    }     const int maxDist = ranges::max(dist);    return maxDist == INT_MAX ? -1 : maxDist;  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗