Function dfs

javascript/0261-graph-valid-tree.js:35–42

(node, graph, visited)

};

const dfs = (node, graph, visited) => {
    if (visited.has(node)) return;
    visited.add(node);

    for (const neighbor of graph[node]) {
        dfs(neighbor, graph, visited);
    }
};

/**
 * https://leetcode.com/problems/graph-valid-tree/