add last test

Author: lrvideckis

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp

@@ -16,6 +16,7 @@ int main() {
   }
   vi cnt(n);
   bcc_callback(adj, [&](const vi& nodes) {
+    assert(sz(nodes) >= 2);
     for (int v : nodes) cnt[v]++;
   });
   rep(i, 0, n) if (cnt[i] >= 2) cout << i << '\n';

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp

@@ -0,0 +1,28 @@
+#define PROBLEM \
+  "https://onlinejudge.u-aizu.ac.jp/problems/GRL_3_B"
+#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;
+  }
+  vector<pii> bridges;
+  bcc_callback(adj, [&](const vi& nodes) {
+    assert(sz(nodes) >= 2);
+    if (sz(nodes) == 2)
+      bridges.push_back({min(nodes[0], nodes[1]),
+        max(nodes[0], nodes[1])});
+  });
+  ranges::sort(bridges);
+  for (auto [u, v] : bridges)
+    cout << u << ' ' << v << endl;
+  return 0;
+}

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp

@@ -20,6 +20,7 @@ int main() {
   UF uf(n);
   vector<bool> seen(m);
   bcc_callback(adj, [&](const vi& nodes) {
+    assert(sz(nodes) >= 2);
     int cnt_edges = 0;
     rep(i, 0, sz(nodes) - 1) for (
       int e_id : adj_e_id[nodes[i]]) if (!seen[e_id]) {