(n, edges)
| 22 | }); |
| 23 | |
| 24 | var buildGraph = (n, edges) => { |
| 25 | const { graph, visited } = initGraph(n); |
| 26 | |
| 27 | for (const [src, dst] of edges) { |
| 28 | graph[src].push(dst); |
| 29 | graph[dst].push(src); |
| 30 | } |
| 31 | |
| 32 | return { graph, visited }; |
| 33 | }; |
| 34 | |
| 35 | const dfs = (node, graph, visited) => { |
| 36 | if (visited.has(node)) return; |