nit

Author: lrvideckis

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);