renaming

Author: lrvideckis

library/graphs/euler_walk.hpp library/graphs/euler_path.hpplibrary/graphs/euler_walk.hpp renamed to library/graphs/euler_path.hpp

@@ -7,11 +7,11 @@
 //!     u--, v--;
 //!     adj[u] += {v, i};
 //!   }
-//!   vector<pii> path = euler_walk(adj, m, s);
+//!   vector<pii> path = euler_path(adj, m, s);
 //! @endcode
 //! @time O(n + m)
 //! @space O(n + m)
-vector<pii> euler_walk(auto& adj, int m, int s) {
+vector<pii> euler_path(auto& adj, int m, int s) {
   vi vis(m);
   vector<pii> path;
   auto dfs = [&](auto&& self, int u, int eu) -> void {

tests/library_checker_aizu_tests/graphs/euler_walk_directed.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/eulerian_trail_directed"
 #include "../template.hpp"
-#include "../../../library/graphs/euler_walk.hpp"
+#include "../../../library/graphs/euler_path.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int t;
@@ -31,7 +31,7 @@ int main() {
     auto it = ranges::find(deg, 1);
     if (it != end(deg)) s = it - begin(deg);
     else if (s == -1) s = 0;
-    vector<pii> res = euler_walk(adj, m, s);
+    vector<pii> res = euler_path(adj, m, s);
     if (ssize(res) != m + 1) {
       cout << "No" << '\n';
       continue;

tests/library_checker_aizu_tests/graphs/euler_walk_undirected.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/eulerian_trail_undirected"
 #include "../template.hpp"
-#include "../../../library/graphs/euler_walk.hpp"
+#include "../../../library/graphs/euler_path.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int t;
@@ -28,7 +28,7 @@ int main() {
     auto it = ranges::find(deg, 1);
     if (it != end(deg)) s = it - begin(deg);
     else if (s == -1) s = 0;
-    vector<pii> res = euler_walk(adj, m, s);
+    vector<pii> res = euler_path(adj, m, s);
     if (ssize(res) != m + 1) {
       cout << "No" << '\n';
       continue;