initial re-org

Author: lrvideckis

…ary/graphs/bridges_cuts/bcc_callback.hpp library/graphs/bcc_callback.hpplibrary/graphs/bridges_cuts/bcc_callback.hpp renamed to library/graphs/bcc_callback.hpp library/graphs/bridges_cuts/bcc_callback.hpp renamed to library/graphs/bcc_callback.hpp

@@ -15,28 +15,20 @@ struct func_graph {
   vector<pii> root_of;
   vector<vi> cycle, childs;
   func_graph(const vi& a): root_of(sz(a)), childs(sz(a)) {
-    vi state(sz(a));
-    rep(i, 0, sz(a)) if (!state[i]) {
+    vi vis(sz(a));
+    rep(i, 0, sz(a)) if (!vis[i]) {
       int u = i;
-      while (!state[u]) {
-        state[u] = 1;
-        u = a[u];
-      }
-      if (state[u] == 1) {
-        cycle.emplace_back();
-        while (state[u] == 1) {
+      for (; !vis[u]; u = a[u]) vis[u] = 1;
+      if (vis[u] == 1)
+        for (cycle.emplace_back(); vis[u] == 1; u = a[u]) {
           root_of[u] = {sz(cycle) - 1, sz(cycle.back())};
           cycle.back().push_back(u);
-          state[u] = 2;
-          u = a[u];
+          vis[u] = 2;
         }
-      }
-      int v = i;
-      while (state[v] == 1) {
+      for (int v = i; vis[v] == 1; v = a[v]) {
         root_of[v] = root_of[u];
         childs[a[v]].push_back(v);
-        state[v] = 2;
-        v = a[v];
+        vis[v] = 2;
       }
     }
   }

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

@@ -16,14 +16,16 @@ vector<vector<ll>> naive(const vector<vi>& adj) {
       for (int node = u; node != v;
         node = lc.next_on_path(node, v))
         cnts_naive[path_length_edges][node]++;
+      assert(path_length_edges < ssize(cnts_naive));
+      assert(v < ssize(cnts_naive[path_length_edges]));
       cnts_naive[path_length_edges][v]++;
     }
   }
   return cnts_naive;
 }
 int main() {
   cin.tie(0)->sync_with_stdio(0);
-  for (int n = 1; n <= 100; n++) {
+  for (int n = 1; n <= 1; n++) {
     vector<vi> adj(n);
     for (int i = 1; i < n; i++) {
       int par = rnd<int>(0, i - 1);