revert name back

Author: lrvideckis

…phs/scc/add_edges_strongly_connected.hpp …ponents/add_edges_strongly_connected.hpplibrary/graphs/scc/add_edges_strongly_connected.hpp renamed to library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp library/graphs/scc/add_edges_strongly_connected.hpp renamed to library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp

@@ -1,9 +1,9 @@
-#define PROBLEM \
-  "https://judge.yosupo.jp/problem/incremental_scc"
-#include "../template.hpp"
+#define PROBLEM "https://judge.yosupo.jp/problem/incremental_scc"
+#include "../../../library/graphs/strongly_connected_components/offline_incremental_scc.hpp"
+
 #include "../../../kactl/content/data-structures/UnionFind.h"
-#include "../../../library/graphs/scc/offline_incremental_scc.hpp"
 #include "../../../library/math/mod_int.hpp"
+#include "../template.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -18,8 +18,7 @@ int main() {
     assert((eds[t][0] == eds[t][1]) == (joins[t] == -1));
   vector<int> order(m);
   iota(all(order), 0);
-  ranges::sort(all(order), {},
-    [&](int i) { return joins[i]; });
+  ranges::sort(all(order), {}, [&](int i) { return joins[i]; });
   UF uf(n);
   mint sum = 0;
   for (int t = 0, it = 0; t < m; t++) {

…y/graphs/scc/offline_incremental_scc.hpp …d_components/offline_incremental_scc.hpplibrary/graphs/scc/offline_incremental_scc.hpp renamed to library/graphs/strongly_connected_components/offline_incremental_scc.hpp library/graphs/scc/offline_incremental_scc.hpp renamed to library/graphs/strongly_connected_components/offline_incremental_scc.hpp

@@ -1,7 +1,7 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/scc"
-#include "../template.hpp"
+#include "../../../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp"
 #include "../scc_asserts.hpp"
-#include "../../../library/graphs/scc/add_edges_strongly_connected.hpp"
+#include "../template.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
@@ -16,8 +16,7 @@ int main() {
   auto [num_sccs, scc_id] = sccs(adj);
   cout << num_sccs << '\n';
   vector<vector<int>> each_scc(num_sccs);
-  for (int i = 0; i < n; i++)
-    each_scc[scc_id[i]].push_back(i);
+  for (int i = 0; i < n; i++) each_scc[scc_id[i]].push_back(i);
   for (int i = num_sccs - 1; i >= 0; i--) {
     cout << sz(each_scc[i]) << " ";
     for (auto node : each_scc[i]) cout << node << " ";

library/graphs/scc/scc.hpp …hs/strongly_connected_components/scc.hpplibrary/graphs/scc/scc.hpp renamed to library/graphs/strongly_connected_components/scc.hpp library/graphs/scc/scc.hpp renamed to library/graphs/strongly_connected_components/scc.hpp

@@ -1,7 +1,7 @@
 #pragma once
 #include "../../library/contest/random.hpp"
-#include "../../library/graphs/scc/add_edges_strongly_connected.hpp"
-#include "../../library/graphs/scc/offline_incremental_scc.hpp"
+#include "../../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp"
+#include "../../library/graphs/strongly_connected_components/offline_incremental_scc.hpp"
 void scc_asserts(const vector<vector<int>>& adj) {
   int n = sz(adj);
   auto [num_sccs, scc_id] = sccs(adj);
@@ -10,8 +10,7 @@ void scc_asserts(const vector<vector<int>>& adj) {
     for (int i = 0; i < n; i++)
       for (auto j : adj[i]) assert(scc_id[i] >= scc_id[j]);
   }
-  vector<bool> is_zero_in(num_sccs, 1),
-    is_zero_out(num_sccs, 1);
+  vector<bool> is_zero_in(num_sccs, 1), is_zero_out(num_sccs, 1);
   for (int i = 0; i < n; i++) {
     for (int v : adj[i]) {
       if (scc_id[i] == scc_id[v]) continue;
@@ -21,14 +20,13 @@ void scc_asserts(const vector<vector<int>>& adj) {
   }
   // since {num_sccs-1, ..., 2, 1, 0} is a topo order
   assert(is_zero_in[num_sccs - 1] && is_zero_out[0]);
-  int num_zero_in =
-    int(count(begin(is_zero_in), end(is_zero_in), 1));
-  int num_zero_out =
-    int(count(begin(is_zero_out), end(is_zero_out), 1));
-  vector<pair<int, int>> edges =
-    extra_edges(adj, num_sccs, scc_id);
-  if (num_sccs == 1) assert(sz(edges) == 0);
-  else assert(sz(edges) == max(num_zero_in, num_zero_out));
+  int num_zero_in = int(count(begin(is_zero_in), end(is_zero_in), 1));
+  int num_zero_out = int(count(begin(is_zero_out), end(is_zero_out), 1));
+  vector<pair<int, int>> edges = extra_edges(adj, num_sccs, scc_id);
+  if (num_sccs == 1)
+    assert(sz(edges) == 0);
+  else
+    assert(sz(edges) == max(num_zero_in, num_zero_out));
   vector<vector<int>> adj_copy(adj);
   for (auto [u, v] : edges) {
     assert(u != v);