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

(limited to 'graph/scc.cpp')

diff --git a/graph/scc.cpp b/graph/scc.cpp
index b21d544..17f4a96 100644
--- a/graph/scc.cpp
+++ b/graph/scc.cpp
@@ -1,4 +1,4 @@
-vector<vector<int>> adjlist;
+vector<vector<int>> adj;
 
 int counter, sccCounter;
 vector<bool> inStack;
@@ -10,7 +10,7 @@ void visit(int v) {
 	d[v] = low[v] = counter++;
 	s.push_back(v); inStack[v] = true;
 
-	for (auto u : adjlist[v]) {
+	for (auto u : adj[v]) {
 		if (d[u] < 0) {
 			visit(u);
 			low[v] = min(low[v], low[u]);
@@ -30,12 +30,12 @@ void visit(int v) {
 }}
 
 void scc() {
-	inStack.assign(sz(adjlist), false);
-	d.assign(sz(adjlist), -1);
-	low.assign(sz(adjlist), -1);
-	idx.assign(sz(adjlist), -1);
+	inStack.assign(sz(adj), false);
+	d.assign(sz(adj), -1);
+	low.assign(sz(adj), -1);
+	idx.assign(sz(adj), -1);
 
 	counter = sccCounter = 0;
-	for (int i = 0; i < sz(adjlist); i++) {
+	for (int i = 0; i < sz(adj); i++) {
 		if (d[i] < 0) visit(i);
 }}
-- 
cgit v1.2.3