(n, edges, root = 0)
| 6 | * @return {boolean} |
| 7 | */ |
| 8 | var validTree = function (n, edges, root = 0) { |
| 9 | const isEqual = edges.length === n - 1; |
| 10 | if (!isEqual) return false; |
| 11 | |
| 12 | const { graph, visited } = buildGraph(n, edges); |
| 13 | |
| 14 | dfs(root, graph, visited); |
| 15 | |
| 16 | return visited.size === n; |
| 17 | }; |
| 18 | |
| 19 | var initGraph = (n) => ({ |
| 20 | graph: new Array(n).fill().map(() => []), |
nothing calls this directly
no test coverage detected