This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub knshnb/competitive_library
#include "src/Helper/TreeDFS.hpp"
auto dfs = [&](auto&& self, int v, int prv) -> void { for (int s : g[v]) { if (s == prv) continue; self(self, s, v); } }; dfs(dfs, 0, -1);
#line 1 "src/Helper/TreeDFS.hpp" auto dfs = [&](auto&& self, int v, int prv) -> void { for (int s : g[v]) { if (s == prv) continue; self(self, s, v); } }; dfs(dfs, 0, -1);