golf (#136)

* Update cuts_callback.hpp

* [auto-verifier] verify commit cbaaa72

* more golf

* [auto-verifier] verify commit 408c4e1

* more golf

* [auto-verifier] verify commit fa49926

---------

Co-authored-by: GitHub <noreply@github.com>

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -52,7 +52,7 @@
 "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2024-12-05 10:41:42 -0600",
 "tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2025-02-10 23:30:47 -0700",
 "tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp": "2024-12-14 19:50:29 -0600",
-"tests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp": "2025-06-23 04:22:44 -0600",
+"tests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp": "2025-06-23 04:31:17 -0600",
 "tests/library_checker_aizu_tests/graphs/dijkstra_aizu.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/graphs/dijkstra_lib_checker.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2025-02-10 23:30:47 -0700",

library/graphs/bridges_cuts/cuts_callback.hpp

@@ -15,20 +15,18 @@
 void cuts_callback(const auto& adj, auto f) {
   int n = sz(adj), q = 0, s = 0;
   vi tin(n), st(n);
-  auto dfs = [&](auto&& self, int v, int p) -> int {
-    int low = tin[v] = ++q;
-    for (int u : adj[v])
-      if (u != p) {
-        int siz = s, lu = 0;
-        low = min(low,
-          tin[u] ?: (lu = self(self, st[s++] = u, v)));
-        if (lu >= tin[v]) {
-          st[s++] = v;
-          f(vi(siz + all(st) - n + s));
-          s = siz;
-        }
+  auto dfs = [&](auto&& self, int v) -> int {
+    int l = tin[v] = ++q;
+    for (int u : adj[v]) {
+      int siz = s, lu = 0;
+      l = min(l, tin[u] ?: (lu = self(self, st[s++] = u)));
+      if (lu >= tin[v]) {
+        st[s++] = v;
+        f(vi(siz + all(st) - n + s));
+        s = siz;
       }
-    return low;
+    }
+    return l;
   };
-  rep(i, 0, n) if (!tin[i]) dfs(dfs, i, i);
+  rep(i, 0, n) if (!tin[i]) dfs(dfs, i);
 }