PS/기타1 Euler circuit, Euler tour technique Euler circuit vector adj; vector circuit; void dfs(int cur) { for (int next = 0; next 0) { adj[cur][next]--; adj[next][cur]--; dfs(next); } } circuit.push_back(cur); } Euler tour technique int S[100010], E[100010], cnt; vector adj; void dfs(int cur, int prev) { S[cur] = ++cnt; for (auto next: adj[cur]) { if (next == prev) continue; dfs(next, c.. 2022. 10. 14. 이전 1 다음