another rename

Author: lrvideckis

library/graphs/bcc_callback.hpp

@@ -5,7 +5,7 @@
 //!     vector<vi> adj(n);
 //!     UF uf(n);
 //!     vector<bool> seen(n);
-//!     bcc_callback(adj, [&](const vi& nodes) {
+//!     bcc(adj, [&](const vi& nodes) {
 //!       int count_edges = 0;
 //!       rep (i, 0, sz(nodes) - 1) {
 //!         seen[nodes[i]] = 1;
@@ -30,7 +30,7 @@
 //!   vector<basic_string<int>> adj(n);
 //!   vector<basic_string<int>> block_vertex_tree(2 * n);
 //!   int bcc_id = n;
-//!   bcc_callback(adj, [&](const vi& nodes) {
+//!   bcc(adj, [&](const vi& nodes) {
 //!     for (int u : nodes) {
 //!       block_vertex_tree[u] += bcc_id;
 //!       block_vertex_tree[bcc_id] += u;
@@ -41,7 +41,7 @@
 //! callback not called on components with a single node
 //! @time O(n + m)
 //! @space O(n)
-void bcc_callback(const auto& adj, auto f) {
+void bcc(const auto& adj, auto f) {
   int n = sz(adj), q = 0, s = 0;
   vi t(n), st(n);
   auto dfs = [&](auto&& self, int u) -> int {

library/graphs/scc.hpp

@@ -2,13 +2,13 @@
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/SCC.h
 //! @code
 //!   vector<basic_string<int>> adj(n);
-//!   auto [num_sccs, scc_id] = sccs(adj);
+//!   auto [num_sccs, scc_id] = scc(adj);
 //! @endcode
 //! scc_id[u] = id, 0<=id<num_sccs
 //! for each edge u -> v: scc_id[u] >= scc_id[v]
 //! @time O(n + m)
 //! @space O(n)
-auto sccs(const auto& adj) {
+auto scc(const auto& adj) {
   int n = sz(adj), num_sccs = 0, q = 0, s = 0;
   vi scc_id(n, -1), tin(n), st(n);
   auto dfs = [&](auto&& self, int u) -> int {

library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp

@@ -8,7 +8,7 @@
 //! SCCs)
 //!
 //! @code
-//!   auto [num_sccs, scc_id] = sccs(adj);
+//!   auto [num_sccs, scc_id] = scc(adj);
 //!   vector<pii> edges = extra_edges(adj,
 //!     num_sccs, scc_id);
 //! @endcode

library/graphs/strongly_connected_components/offline_incremental_scc.hpp

@@ -32,7 +32,7 @@ vi offline_incremental_scc(vector<array<int, 2>> eds,
       if (*it <= mid) adj[u].push_back(v);
     }
     rep(i, 0, sz(adj)) ids[vs[i]] = -1;
-    scc_id = sccs(adj).second;
+    scc_id = scc(adj).second;
     auto split = partition(el, er, [&](int i) {
       return scc_id[eds[i][0]] == scc_id[eds[i][1]];
     });

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp

@@ -15,7 +15,7 @@ int main() {
     adj[v].push_back(u);
   }
   vi cnt(n);
-  bcc_callback(adj, [&](const vi& nodes) {
+  bcc(adj, [&](const vi& nodes) {
     assert(sz(nodes) >= 2);
     for (int v : nodes) cnt[v]++;
   });

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp

@@ -15,7 +15,7 @@ int main() {
     adj[v].push_back(u);
   }
   vector<pii> bridges;
-  bcc_callback(adj, [&](const vi& nodes) {
+  bcc(adj, [&](const vi& nodes) {
     if (sz(nodes) == 2) {
       pii bridge(nodes[0], nodes[1]);
       if (bridge.first > bridge.second)

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp

@@ -16,7 +16,7 @@ int main() {
   }
   vector<bool> vis(n, 0);
   vector<vector<int>> all_bccs;
-  bcc_callback(adj, [&](const vi& nodes) {
+  bcc(adj, [&](const vi& nodes) {
     assert(ssize(nodes) >= 2);
     for (int v : nodes) vis[v] = 1;
     all_bccs.push_back(nodes);

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp

@@ -16,7 +16,7 @@ int main() {
   }
   DSU dsu(n);
   vector<bool> seen(n);
-  bcc_callback(adj, [&](const vi& nodes) {
+  bcc(adj, [&](const vi& nodes) {
     int count_edges = 0;
     rep(i, 0, sz(nodes) - 1) {
       seen[nodes[i]] = 1;

tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp

@@ -15,7 +15,7 @@ int main() {
     adj_edge_id[u].emplace_back(v, i);
   }
   scc_asserts(adj);
-  auto [num_sccs, scc_id] = sccs(adj);
+  auto [num_sccs, scc_id] = scc(adj);
   if (num_sccs == n) {
     cout << -1 << '\n';
     return 0;

tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp

@@ -14,7 +14,7 @@ int main() {
     adj[u].push_back(v);
   }
   scc_asserts(adj);
-  auto [num_sccs, scc_id] = sccs(adj);
+  auto [num_sccs, scc_id] = scc(adj);
   int q;
   cin >> q;
   while (q--) {