Use pattern matching to make BiconnectedComponents a little shorter (…

…#254)
kth-competitive-programming · Apr 20, 2024 · 19fb5e2 · 19fb5e2
1 parent 431a6ef
commit 19fb5e2
Showing 1 changed file with 2 additions and 3 deletions.
diff --git a/content/graph/BiconnectedComponents.h b/content/graph/BiconnectedComponents.h
@@ -24,9 +24,8 @@ vector<vector<pii>> ed;
 int Time;
 template<class F>
 int dfs(int at, int par, F& f) {
-	int me = num[at] = ++Time, e, y, top = me;
-	for (auto pa : ed[at]) if (pa.second != par) {
-		tie(y, e) = pa;
+	int me = num[at] = ++Time, top = me;
+	for (auto [y, e] : ed[at]) if (e != par) {
 		if (num[y]) {
 			top = min(top, num[y]);
 			if (num[y] < me)