update

Author: lrvideckis

library/graphs/bridges_cuts/cuts_callback.hpp

@@ -29,8 +29,11 @@ void cuts_callback(const auto& adj, auto f) {
         int siz = s, lu = 0;
         low = min(low,
           tin[u] ?: (lu = self(self, st[s++] = u, v)));
-        if (lu >= tin[v])
-          f(v, vi(siz + all(st) - (n - s))), s = siz;
+        if (lu >= tin[v]) {
+          st[s++] = v;
+          f(vi(siz + all(st) - (n - s)));
+          s = siz;
+        }
       }
     return low;
   };

tests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp

@@ -18,13 +18,11 @@ int main() {
   }
   vector<bool> vis(n, 0);
   vector<vector<int>> all_bccs;
-  cuts_callback(adj, [&](int v, const vi& nodes_bcc) {
-    vis[v] = 1;
-    for(int u : nodes_bcc){
-      vis[u] = 1;
+  cuts_callback(adj, [&](const vi& nodes_bcc) {
+    for(int v : nodes_bcc){
+      vis[v] = 1;
     }
     all_bccs.push_back(nodes_bcc);
-    all_bccs.back().push_back(v);
   });
   for (int i = 0; i <n; i++) {
     if(!vis[i]) {