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/minCostMaxFlow.cpp | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

(limited to 'graph/minCostMaxFlow.cpp')

diff --git a/graph/minCostMaxFlow.cpp b/graph/minCostMaxFlow.cpp
index d6d0586..0e33ae4 100644
--- a/graph/minCostMaxFlow.cpp
+++ b/graph/minCostMaxFlow.cpp
@@ -5,7 +5,7 @@ struct MinCostFlow {
 		ll f, cost;
 	};
 	vector<edge> edges;
-	vector<vector<int>> adjlist;
+	vector<vector<int>> adj;
 	vector<int> pref, con;
 	vector<ll> dist;
 
@@ -13,19 +13,19 @@ struct MinCostFlow {
 	ll maxflow, mincost;
 
 	MinCostFlow(int n, int source, int target) :
-		adjlist(n), s(source), t(target) {};
+		adj(n), s(source), t(target) {};
 
 	void addedge(int u, int v, ll c, ll cost) {
-		adjlist[u].push_back(sz(edges));
+		adj[u].push_back(sz(edges));
 		edges.push_back({v, c, cost});
-		adjlist[v].push_back(sz(edges));
+		adj[v].push_back(sz(edges));
 		edges.push_back({u, 0, -cost});
 	}
 
 	bool SPFA() {
-		pref.assign(sz(adjlist), -1);
-		dist.assign(sz(adjlist), INF);
-		vector<bool> inqueue(sz(adjlist));
+		pref.assign(sz(adj), -1);
+		dist.assign(sz(adj), INF);
+		vector<bool> inqueue(sz(adj));
 		queue<int> queue;
 
 		dist[s] = 0;
@@ -36,7 +36,7 @@ struct MinCostFlow {
 		while (!queue.empty()) {
 			int cur = queue.front(); queue.pop();
 			inqueue[cur] = false;
-			for (int id : adjlist[cur]) {
+			for (int id : adj[cur]) {
 				int to = edges[id].to;
 				if (edges[id].f > 0 &&
 				    dist[to] > dist[cur] + edges[id].cost) {
@@ -62,7 +62,7 @@ struct MinCostFlow {
 	}}
 
 	void mincostflow() {
-		con.assign(sz(adjlist), 0);
+		con.assign(sz(adj), 0);
 		maxflow = mincost = 0;
 		while (SPFA()) extend();
 	}
-- 
cgit v1.2.3