nits

Author: lrvideckis

library/graphs/euler_walk.hpp

@@ -2,15 +2,13 @@
 vector<pii> euler_walk(auto& adj, int m, int s) {
   vi vis(m);
   vector<pii> path;
-  auto dfs = [&](auto&& self, int u, int e) -> void {
+  auto dfs = [&](auto&& self, int u, int eu) -> void {
     while (!empty(adj[u])) {
-      auto [v, e_id] = adj[u].back();
+      auto [v, ev] = adj[u].back();
       adj[u].pop_back();
-      if (vis[e_id]) continue;
-      vis[e_id] = 1;
-      self(self, v, e_id);
+      if (!vis[ev]) vis[ev] = 1, self(self, v, ev);
     }
-    path.push_back({u, e});
+    path.emplace_back(u, eu);
   };
   dfs(dfs, s, -1);
   ranges::reverse(path);

tests/library_checker_aizu_tests/graphs/euler_walk_directed.test.cpp

@@ -16,7 +16,7 @@ int main() {
       int u, v;
       cin >> u >> v;
       s = u;
-      adj[u].push_back({v, i});
+      adj[u].emplace_back(v, i);
       deg[u]++;
       deg[v]--;
     }

tests/library_checker_aizu_tests/graphs/euler_walk_undirected.test.cpp

@@ -16,8 +16,8 @@ int main() {
       int u, v;
       cin >> u >> v;
       s = u;
-      adj[u].push_back({v, i});
-      adj[v].push_back({u, i});
+      adj[u].emplace_back(v, i);
+      adj[v].emplace_back(u, i);
       deg[u] ^= 1;
       deg[v] ^= 1;
     }