fix (#168)

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/dsu.test.cpp

@@ -10,7 +10,7 @@ int main() {
     int type, u, v;
     cin >> type >> u >> v;
     if (type == 0) dsu.join(u, v);
-    else cout << (dsu.go(u) == dsu.go(v)) << '\n';
+    else cout << (dsu.f(u) == dsu.f(v)) << '\n';
   }
   return 0;
 }

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp

@@ -31,7 +31,7 @@ int main() {
     for (int v : nodes) dsu.join(v, nodes[0]);
   });
   vector<vi> two_edge_ccs(n);
-  rep(i, 0, n) two_edge_ccs[dsu.go(i)].push_back(i);
+  rep(i, 0, n) two_edge_ccs[dsu.f(i)].push_back(i);
   int cnt_ccs = 0;
   rep(i, 0, n) cnt_ccs += (!empty(two_edge_ccs[i]));
   cout << cnt_ccs << '\n';

tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp

@@ -25,8 +25,8 @@ int main() {
   for (int t = 0, it = 0; t < m; t++) {
     while (it < m && joins[order[it]] <= t) {
       auto [u, v] = eds[order[it]];
-      u = dsu.go(u);
-      v = dsu.go(v);
+      u = dsu.f(u);
+      v = dsu.f(v);
       if (dsu.p[u] > dsu.p[v]) swap(u, v);
       if (u != v) {
         sum = (sum + 1LL * xs[u] * xs[v]) % mod;