add another test

Author: lrvideckis

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp

@@ -0,0 +1,23 @@
+#define PROBLEM \
+  "https://onlinejudge.u-aizu.ac.jp/problems/GRL_3_A"
+#include "../template.hpp"
+#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, m;
+  cin >> n >> m;
+  vector<basic_string<int>> adj(n);
+  for (int i = 0; i < n; i++) adj[i] += i;
+  for (int i = 0; i < m; i++) {
+    int u, v;
+    cin >> u >> v;
+    adj[u] += v;
+    adj[v] += u;
+  }
+  vi cnt(n);
+  bcc_callback(adj, [&](const vi& nodes) {
+    for (int v : nodes) cnt[v]++;
+  });
+  rep(i, 0, n) if (cnt[i] >= 2) cout << i << '\n';
+  return 0;
+}

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp

@@ -16,10 +16,10 @@ int main() {
   }
   vector<bool> vis(n, 0);
   vector<vector<int>> all_bccs;
-  bcc_callback(adj, [&](const vi& nodes_bcc) {
-    assert(ssize(nodes_bcc) >= 2);
-    for (int v : nodes_bcc) vis[v] = 1;
-    all_bccs.push_back(nodes_bcc);
+  bcc_callback(adj, [&](const vi& nodes) {
+    assert(ssize(nodes) >= 2);
+    for (int v : nodes) vis[v] = 1;
+    all_bccs.push_back(nodes);
   });
   for (int i = 0; i < n; i++)
     if (!vis[i]) all_bccs.push_back({i});