Rename cuts callback (#138)

* rename

* [auto-verifier] verify commit ac413c3

---------

Co-authored-by: GitHub <noreply@github.com>

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -50,9 +50,9 @@
 "tests/library_checker_aizu_tests/flow/dinic_aizu.test.cpp": "2024-11-17 14:04:03 -0600",
 "tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2024-11-17 14:04:03 -0600",
 "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2024-12-05 10:41:42 -0600",
+"tests/library_checker_aizu_tests/graphs/bcc_callback.test.cpp": "2025-06-23 18:30:19 -0600",
 "tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2025-02-10 23:30:47 -0700",
 "tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp": "2024-12-14 19:50:29 -0600",
-"tests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp": "2025-06-23 18:27:40 -0600",
 "tests/library_checker_aizu_tests/graphs/dijkstra_aizu.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/graphs/dijkstra_lib_checker.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2025-02-10 23:30:47 -0700",

…ry/graphs/bridges_cuts/cuts_callback.hpp …ary/graphs/bridges_cuts/bcc_callback.hpplibrary/graphs/bridges_cuts/cuts_callback.hpp renamed to library/graphs/bridges_cuts/bcc_callback.hpp library/graphs/bridges_cuts/cuts_callback.hpp renamed to library/graphs/bridges_cuts/bcc_callback.hpp

@@ -5,7 +5,7 @@
 //!     vector<vector<int>> adj(n);
 //!     vector<pii> edges(m);
 //!     UF uf(n);
-//!     cuts_callback(adj, [&](const vi& nodes) {
+//!     bcc_callback(adj, [&](const vi& nodes) {
 //!       if (sz(nodes) > 2)
 //!         for (int v : nodes) uf.join(v, nodes[0]);
 //!     });
@@ -21,7 +21,7 @@
 //!   vector<basic_string<int>> adj(n);
 //!   vector<basic_string<array<int, 2>>> adj_edge_ids(n);
 //!   vector<bool> seen(m);
-//!   cuts_callback(adj, [&](const vi& nodes) {
+//!   bcc_callback(adj, [&](const vi& nodes) {
 //!     rep (i, 0, sz(nodes) - 1)
 //!       for (auto [u, e_id] : adj_edge_ids[nodes[i]])
 //!         if (!seen[e_id]) {
@@ -33,7 +33,7 @@
 //! callback not called on components with a single node
 //! @time O(n + m)
 //! @space O(n + m)
-void cuts_callback(const auto& adj, auto f) {
+void bcc_callback(const auto& adj, auto f) {
   int n = sz(adj), q = 0, s = 0;
   vi tin(n), st(n);
   auto dfs = [&](auto&& self, int v) -> int {

…aizu_tests/graphs/cuts_callback.test.cpp …_aizu_tests/graphs/bcc_callback.test.cpptests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp renamed to tests/library_checker_aizu_tests/graphs/bcc_callback.test.cpp tests/library_checker_aizu_tests/graphs/cuts_callback.test.cpp renamed to tests/library_checker_aizu_tests/graphs/bcc_callback.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/biconnected_components"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/cuts_callback.hpp"
+#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -16,7 +16,7 @@ int main() {
   }
   vector<bool> vis(n, 0);
   vector<vector<int>> all_bccs;
-  cuts_callback(adj, [&](const vi& nodes_bcc) {
+  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);