We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 88fca50 + 5d6788d commit 28b5dd3Copy full SHA for 28b5dd3
library/graphs/bridges_cuts/bcc_callback.hpp
@@ -6,8 +6,9 @@
6
//! vector<pii> edges(m);
7
//! UF uf(n);
8
//! bcc_callback(adj, [&](const vi& nodes) {
9
-//! if (sz(nodes) > 2) // assumes no multiple edges
10
-//! for (int v : nodes) uf.join(v, nodes[0]);
+//! if (sz(nodes) == 2)
+//! return; // bridge assuming no multiple edges
11
+//! for (int v : nodes) uf.join(v, nodes[0]);
12
//! });
13
//! vector<basic_string<int>> bridge_tree(n);
14
//! for (auto [u, v] : edges)
0 commit comments