Function checkNeighbor

javascript/0261-graph-valid-tree.js:91–100

(graph, visited, queue)

};

const checkNeighbor = (graph, visited, queue) => {
    const node = queue.dequeue();

    for (const neighbor of graph[node]) {
        if (visited.has(neighbor)) continue;
        visited.add(neighbor);

        queue.enqueue(neighbor);
    }
};

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