fix some tests

Author: lrvideckis

library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp

@@ -1,5 +1,5 @@
 #pragma once
-#include "scc.hpp"
+#include "../scc.hpp"
 //! https://codeforces.com/blog/entry/15102
 //! Add minimum extra directed edges to directed graph to
 //! make it strongly connected. If the directed graph is

library/graphs/strongly_connected_components/offline_incremental_scc.hpp

@@ -1,5 +1,5 @@
 #pragma once
-#include "scc.hpp"
+#include "../scc.hpp"
 //! https://codeforces.com/blog/entry/91608
 //! @code
 //!   auto joins = offline_incremental_scc(eds, n);

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/problems/GRL_3_A"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+#include "../../../library/graphs/bcc_callback.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/problems/GRL_3_B"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+#include "../../../library/graphs/bcc_callback.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/biconnected_components"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+#include "../../../library/graphs/bcc_callback.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/two_edge_connected_components"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/bcc_callback.hpp"
+#include "../../../library/graphs/bcc_callback.hpp"
 #include "../../../kactl/content/data-structures/UnionFind.h"
 int main() {
   cin.tie(0)->sync_with_stdio(0);

tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/biconnected_components"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/block_vertex_tree.hpp"
+#include "../../../library/graphs/uncommon/block_vertex_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/connected_components_of_complement_graph"
 #include "../template.hpp"
-#include "../../../library/graphs/complement_graph_ccs.hpp"
+#include "../../../library/graphs/uncommon/complement_graph_ccs.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/enumerate_triangles.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/enumerate_triangles"
 #include "../template.hpp"
-#include "../../../library/graphs/enumerate_triangles.hpp"
+#include "../../../library/graphs/uncommon/enumerate_triangles.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;

tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/two_edge_connected_components"
 #include "../template.hpp"
-#include "../../../library/graphs/bridges_cuts/bridge_tree.hpp"
+#include "../../../library/graphs/uncommon/bridge_tree.hpp"
 #include "../../../library/data_structures/dsu/dsu_restorable.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);