Function bfs

javascript/0127-word-ladder.js:24–37

(queue, wordSet, seen, endWord)

};

const bfs = (queue, wordSet, seen, endWord) => {
    while (!queue.isEmpty()) {
        for (let i = queue.size() - 1; 0 <= i; i--) {
            const [word, depth] = queue.dequeue();

            const isTarget = word === endWord;
            if (isTarget) return depth;

            transform(queue, wordSet, seen, word, depth);
        }
    }

    return 0;
};

const transform = (queue, wordSet, seen, word, depth) => {
    for (const index in word) {