We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 010d3f6 commit 57cee5fCopy full SHA for 57cee5f
library/graphs/bridges_cuts/bcc_callback.hpp
@@ -6,7 +6,7 @@
6
//! vector<pii> edges(m);
7
//! UF uf(n);
8
//! bcc_callback(adj, [&](const vi& nodes) {
9
-//! if (sz(nodes) > 2)
+//! if (sz(nodes) > 2) // assumes no multiple edges
10
//! for (int v : nodes) uf.join(v, nodes[0]);
11
//! });
12
//! vector<basic_string<int>> bridge_tree(n);
0 commit comments