nits

Author: lrvideckis

library/graphs/bridges_cuts/bcc_callback.hpp

@@ -32,7 +32,7 @@
 //!     vector<vi> adj(n);
 //!     vector<int> cc_id(n);
 //!     bcc_callback(adj, [&](const vi& nodes) {
-//!       if (ssize(nodes) == 2) {
+//!       if (sz(nodes) == 2) {
 //!         // nodes[0] <=> nodes[1] is a bridge
 //!         return;
 //!       }

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp

@@ -15,16 +15,8 @@ int main() {
     adj[v] += u;
   }
   vector<pii> bridges;
-  vector<bool> seen(n);
   bcc_callback(adj, [&](const vi& nodes) {
-    int count_edges = 0;
-    rep(i, 0, sz(nodes) - 1) {
-      seen[nodes[i]] = 1;
-      count_edges += ranges::count_if(adj[nodes[i]],
-        [&](int v) -> bool { return !seen[v]; });
-    }
-    if (count_edges == 1) {
-      assert(sz(nodes) == 2);
+    if (sz(nodes) == 2) {
       pii bridge(nodes[0], nodes[1]);
       if (bridge.first > bridge.second)
         swap(bridge.first, bridge.second);