Merge branch 'dev' into add_more_bcc_callback_tests

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -50,7 +50,6 @@
 "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_lib_checker_bcc.test.cpp": "2025-06-23 19:01:11 -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/dijkstra_aizu.test.cpp": "2024-12-14 19:50:29 -0600",

library/graphs/bridges_cuts/bcc_callback.hpp

@@ -7,7 +7,7 @@
 //!     UF uf(n);
 //!     bcc_callback(adj, [&](const vi& nodes) {
 //!       if (sz(nodes) == 2)
-//!         return; // bridge assuming no multiple edges
+//!         return; // is bridge assuming no multiple edges
 //!       for (int v : nodes) uf.join(v, nodes[0]);
 //!     });
 //!     vector<basic_string<int>> bridge_tree(n);