Skip to content

graphs re-org #155

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Aug 6, 2025
Merged

graphs re-org #155

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
8c98bff
initial re-org
lrvideckis Aug 6, 2025
0f04ed8
[auto-verifier] verify commit 8c98bff0cd5449afda8a281aa4a1e5289c5286c3
web-flow Aug 6, 2025
7720fb2
revert changes
lrvideckis Aug 6, 2025
ddadf13
Merge branch 'graphs_reorg' of github.com:programming-team-code/progr…
lrvideckis Aug 6, 2025
af1597d
[auto-verifier] verify commit ddadf13edc43cd9294a6ae74c9a23c6a789940c2
web-flow Aug 6, 2025
6e2dcb8
fix some tests
lrvideckis Aug 6, 2025
c30a760
Merge branch 'graphs_reorg' of github.com:programming-team-code/progr…
lrvideckis Aug 6, 2025
d60ec46
[auto-verifier] verify commit c30a7605cca8a41a5c620e185dfe7779ec6fd42e
web-flow Aug 6, 2025
473ad92
remove some files from pdf
lrvideckis Aug 6, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 14 additions & 14 deletions .verify-helper/timestamps.remote.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,28 +50,28 @@
"tests/library_checker_aizu_tests/flow/dinic_aizu.test.cpp": "2024-11-17 14:04:03 -0600",
"tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2024-11-17 14:04:03 -0600",
"tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2024-12-05 10:41:42 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp": "2025-07-08 19:09:51 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp": "2025-07-08 19:09:51 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp": "2025-07-08 19:09:51 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp": "2025-07-08 19:09:51 -0600",
"tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/dijkstra_aizu.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/graphs/dijkstra_lib_checker.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/enumerate_triangles.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/enumerate_triangles.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/hopcroft_karp_aizu.test.cpp": "2025-02-10 23:30:47 -0700",
"tests/library_checker_aizu_tests/graphs/hopcroft_karp_lib_checker.test.cpp": "2025-02-10 23:30:47 -0700",
"tests/library_checker_aizu_tests/graphs/mst.test.cpp": "2024-11-17 14:04:03 -0600",
"tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2025-08-06 13:48:07 -0600",
"tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2025-08-06 15:33:00 -0600",
"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2025-08-06 15:30:13 -0600",
"tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2025-04-27 21:47:37 -0600",
"tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-08-06 15:28:49 -0600",
"tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2024-12-14 19:50:29 -0600",
"tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2025-08-04 17:01:28 -0600",
"tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp": "2025-02-10 14:50:36 -0700",
Expand Down
0 library/graphs/bridges_cuts/bcc_callback.hpp → library/graphs/bcc_callback.hpp
View file
Open in desktop
File renamed without changes.
0 ...phs/strongly_connected_components/scc.hpp → library/graphs/scc.hpp
View file
Open in desktop
File renamed without changes.
2 changes: 1 addition & 1 deletion library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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
Expand Down
2 changes: 1 addition & 1 deletion library/graphs/strongly_connected_components/offline_incremental_scc.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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);
Expand Down
0 ...graphs/bridges_cuts/block_vertex_tree.hpp → ...ary/graphs/uncommon/block_vertex_tree.hpp
View file
Open in desktop
File renamed without changes.
0 library/graphs/bridges_cuts/bridge_tree.hpp → library/graphs/uncommon/bridge_tree.hpp
View file
Open in desktop
File renamed without changes.
0 library/graphs/bridges_cuts/bridges.hpp → library/graphs/uncommon/bridges.hpp
View file
Open in desktop
File renamed without changes.
0 library/graphs/complement_graph_ccs.hpp → .../graphs/uncommon/complement_graph_ccs.hpp
View file
Open in desktop
File renamed without changes.
0 library/graphs/bridges_cuts/cuts.hpp → library/graphs/uncommon/cuts.hpp
View file
Open in desktop
File renamed without changes.
0 library/graphs/enumerate_triangles.hpp → ...y/graphs/uncommon/enumerate_triangles.hpp
View file
Open in desktop
File renamed without changes.
24 changes: 8 additions & 16 deletions ...ary/graphs/functional_graph_processor.hpp → ...s/uncommon/functional_graph_processor.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
}
}
}
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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);
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/enumerate_triangles.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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);
Expand Down
2 changes: 1 addition & 1 deletion tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
"https://onlinejudge.u-aizu.ac.jp/problems/ITP1_1_A"
#include "../template.hpp"
#include "../../../library/contest/random.hpp"
#include "../../../library/graphs/functional_graph_processor.hpp"
#include "../../../library/graphs/uncommon/functional_graph_processor.hpp"
// https://github.com/Aeren1564/Algorithms/blob/master/Algorithm_Implementations_Cpp/Graph_Theory/Special_Graphs/functional_graph_processor.sublime-snippet
struct functional_graph_processor {
functional_graph_processor(const vector<int> &next) {
Expand Down
6 changes: 5 additions & 1 deletion tests/scripts/build_pdf.sh
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,11 @@ rm ../library/data_structures/seg_tree_uncommon/kth_smallest_query.hpp || exit 1
rm ../library/data_structures/uncommon/mode_query.hpp || exit 1
rm ../library/data_structures/uncommon/priority_queue_of_updates.hpp || exit 1
rm ../library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp || exit 1
rm ../library/graphs/functional_graph_processor.hpp || exit 1
rm ../library/graphs/strongly_connected_components/offline_incremental_scc.hpp || exit 1
rm ../library/graphs/uncommon/bridges.hpp || exit 1
rm ../library/graphs/uncommon/cuts.hpp || exit 1
rm ../library/graphs/uncommon/block_vertex_tree.hpp || exit 1
rm ../library/graphs/uncommon/bridge_tree.hpp || exit 1
rm ../library/math/derangements.hpp || exit 1
rm ../library/math/num_distinct_subsequences.hpp || exit 1
rm ../library/math/partitions.hpp || exit 1
Expand Down
Loading