summaryrefslogtreecommitdiff
path: root/graph/articulationPoints.cpp
diff options
context:
space:
mode:
authormzuenni <michi.zuendorf@gmail.com>2023-08-29 00:09:28 +0200
committermzuenni <michi.zuendorf@gmail.com>2023-08-29 00:09:28 +0200
commit4905811a7c635f28827984a999aedacd910f4dc3 (patch)
treed21228d541bb14dc2dc29ffdff2331dfb5ba6b1e /graph/articulationPoints.cpp
parentf209418070050d4310a19191e3cd771760e5b521 (diff)
consistency
Diffstat (limited to 'graph/articulationPoints.cpp')
-rw-r--r--graph/articulationPoints.cpp10
1 files changed, 5 insertions, 5 deletions
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;