ds-algo-study/DS-n-Algos/Graphs/graphs-solution/problems/breadth_first_search.js

Just experimenting with publishing a package

function breadthFirstSearch(startingNode, targetVal) {
    let queue = [ startingNode ];
    let visited = new Set();

    while (queue.length) {
        let node = queue.shift();
        if (visited.has(node)) continue;
        visited.add(node);
        if (node.val === targetVal) return node;

        queue.push(...node.neighbors);
    }

    return null;
}

module.exports = {
    breadthFirstSearch
};