diff options
| author | Yidi <noob999noob999@gmail.com> | 2025-01-28 15:22:57 +0100 |
|---|---|---|
| committer | Yidi <noob999noob999@gmail.com> | 2025-01-28 15:22:57 +0100 |
| commit | 314fdba6e300d8976835d6883540996e03e96e60 (patch) | |
| tree | 3f6e8d02b77c273910efda4d342b5b659a0800f6 | |
| parent | 0c55282e01f07dd6bad486b591b156f7e9aa8fa7 (diff) | |
fix test
| -rw-r--r-- | test/graph/euler.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/test/graph/euler.cpp b/test/graph/euler.cpp index 6666040..457ca99 100644 --- a/test/graph/euler.cpp +++ b/test/graph/euler.cpp @@ -1,6 +1,6 @@ #include "../util.h" struct Euler { - Euler(int n) : idx(n), validIdx(n) {} + Euler(int n) : adj(n) {} #include <graph/euler.cpp> }; @@ -20,7 +20,7 @@ Euler eulerGraph(int n, int m) { } int last = -1; for (int i = 0; i < n; i++) { - if (sz(res.idx[i]) % 2 != 0) { + if (sz(res.adj[i]) % 2 != 0) { if (last >= 0) { res.addEdge(last, i); last = -1; @@ -44,8 +44,8 @@ void stress_test() { vector<vector<int>> expected(n); for (int i = 0; i < n; i++) { - for (int j : g.idx[i]) { - expected[i].push_back(g.to[j]); + for (auto [j, rev] : g.adj[i]) { + expected[i].push_back(j); } sort(all(expected[i])); } |
