add bridge test

Author: lrvideckis

…_aizu_tests/graphs/bcc_callback.test.cpp …hs/bcc_callback_lib_checker_bcc.test.cpptests/library_checker_aizu_tests/graphs/bcc_callback.test.cpp renamed to tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp tests/library_checker_aizu_tests/graphs/bcc_callback.test.cpp renamed to tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp

@@ -0,0 +1,49 @@
+#define PROBLEM \
+  "https://judge.yosupo.jp/problem/two_edge_connected_components"
+#include "../template.hpp"
+#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+#include "../../../kactl/content/data-structures/UnionFind.h"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, m;
+  cin >> n >> m;
+  vector<basic_string<int>> adj(n), adj_e_id(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;
+    adj_e_id[u] += i;
+    adj_e_id[v] += i;
+  }
+
+  UF uf(n);
+  vector<bool> seen(m);
+  bcc_callback(adj, [&](const vi& nodes) {
+    int cnt_edges = 0;
+    rep(i,0,sz(nodes)-1)
+      for(int e_id : adj_e_id[nodes[i]])
+        if(!seen[e_id]) {
+          seen[e_id] = 1;
+          cnt_edges++;
+        }
+    if (cnt_edges >= 2)
+      for (int v : nodes) uf.join(v, nodes[0]);
+  });
+
+  vector<basic_string<int>> two_edge_ccs(n);
+  rep(i,0,n) two_edge_ccs[uf.find(i)] += i;
+  int cnt_ccs = 0;
+  rep(i,0,n) cnt_ccs += (!empty(two_edge_ccs[i]));
+  cout<<cnt_ccs<<'\n';
+  rep(i,0,n) {
+    if(!empty(two_edge_ccs[i])) {
+      cout<<sz(two_edge_ccs[i])<<' ';
+      for(int v:two_edge_ccs[i]) cout<<v<<' ';
+      cout<<'\n';
+    }
+  }
+
+  return 0;
+}