From 4905811a7c635f28827984a999aedacd910f4dc3 Mon Sep 17 00:00:00 2001
From: mzuenni <michi.zuendorf@gmail.com>
Date: Tue, 29 Aug 2023 00:09:28 +0200
Subject: consistency

---
 graph/dijkstra.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'graph/dijkstra.cpp')

diff --git a/graph/dijkstra.cpp b/graph/dijkstra.cpp
index 50c9654..aa938ec 100644
--- a/graph/dijkstra.cpp
+++ b/graph/dijkstra.cpp
@@ -1,16 +1,16 @@
 using path = pair<ll, int>; //dist, destination
 
-void dijkstra(const vector<vector<path>> &adjlist, int start) {
+void dijkstra(const vector<vector<path>>& adj, int start) {
 	priority_queue<path, vector<path>, greater<path>> pq;
-	vector<ll> dist(sz(adjlist), INF);
-	vector<int> prev(sz(adjlist), -1);
+	vector<ll> dist(sz(adj), INF);
+	vector<int> prev(sz(adj), -1);
 	dist[start] = 0; pq.emplace(0, start);
 
 	while (!pq.empty()) {
 		auto [dc, c] = pq.top(); pq.pop();
 		if (dc > dist[c]) continue; // WICHTIG!
 
-		for (auto [dx, x] : adjlist[c]) {
+		for (auto [dx, x] : adj[c]) {
 			ll newDist = dc + dx;
 			if (newDist < dist[x]) {
 				dist[x] = newDist;
-- 
cgit v1.2.3