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

(limited to 'graph/articulationPoints.cpp')

diff --git a/graph/articulationPoints.cpp b/graph/articulationPoints.cpp
index fb18d36..4e3dff7 100644
--- a/graph/articulationPoints.cpp
+++ b/graph/articulationPoints.cpp
@@ -1,4 +1,4 @@
-vector<vector<edge>> adjlist;
+vector<vector<edge>> adj;
 vector<int> num;
 int counter, rootCount, root;
 vector<bool> isArt;
@@ -7,7 +7,7 @@ vector<vector<edge>> bcc;
 
 int dfs(int v, int parent = -1) {
 	int me = num[v] = ++counter, top = me;
-	for (edge& e : adjlist[v]) {
+	for (edge& e : adj[v]) {
 		if (e.id == parent){}
 		else if (num[e.to]) {
 			top = min(top, num[e.to]);
@@ -31,12 +31,12 @@ int dfs(int v, int parent = -1) {
 
 void find() {
 	counter = 0;
-	num.assign(sz(adjlist), 0);
-	isArt.assign(sz(adjlist), false);
+	num.assign(sz(adj), 0);
+	isArt.assign(sz(adj), false);
 	bridges.clear();
 	st.clear();
 	bcc.clear();
-	for (int v = 0; v < sz(adjlist); v++) {
+	for (int v = 0; v < sz(adj); v++) {
 		if (!num[v]) {
 			root = v;
 			rootCount = 0;
-- 
cgit v1.2.3