self to dfs

Author: lrvideckis

library/graphs/bcc_callback.hpp

@@ -44,11 +44,11 @@
 void bcc(const auto& adj, auto f) {
   int n = sz(adj), q = 0, s = 0;
   vi t(n), st(n);
-  auto dfs = [&](auto&& self, int u) -> int {
+  auto dfs = [&](auto&& dfs, int u) -> int {
     int l = t[u] = ++q;
     for (int v : adj[u]) {
       int siz = s, lu = 0;
-      l = min(l, t[v] ?: (lu = self(self, st[s++] = v)));
+      l = min(l, t[v] ?: (lu = dfs(dfs, st[s++] = v)));
       if (lu >= t[u]) {
         st[s++] = u;
         f({siz + all(st) - n + s});