diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2023-08-29 01:07:11 +0200 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2023-08-29 01:07:11 +0200 |
| commit | bc7a54f2a10ff3bb76cf4920be53000264bad279 (patch) | |
| tree | b19e51925e5aa067bf0aba866b9447ba31973adf /graph/dijkstra.cpp | |
| parent | 4905811a7c635f28827984a999aedacd910f4dc3 (diff) | |
consistency
Diffstat (limited to 'graph/dijkstra.cpp')
| -rw-r--r-- | graph/dijkstra.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/graph/dijkstra.cpp b/graph/dijkstra.cpp index aa938ec..57071b0 100644 --- a/graph/dijkstra.cpp +++ b/graph/dijkstra.cpp @@ -7,15 +7,15 @@ void dijkstra(const vector<vector<path>>& adj, int start) { dist[start] = 0; pq.emplace(0, start); while (!pq.empty()) { - auto [dc, c] = pq.top(); pq.pop(); - if (dc > dist[c]) continue; // WICHTIG! + auto [dv, v] = pq.top(); pq.pop(); + if (dv > dist[v]) continue; // WICHTIG! - for (auto [dx, x] : adj[c]) { - ll newDist = dc + dx; - if (newDist < dist[x]) { - dist[x] = newDist; - prev[x] = c; - pq.emplace(newDist, x); + for (auto [du, u] : adj[v]) { + ll newDist = dv + du; + if (newDist < dist[u]) { + dist[u] = newDist; + prev[u] = v; + pq.emplace(dist[u], u); }}} //return dist, prev; } |
