(queue, seen)
| 50 | }; |
| 51 | |
| 52 | const bfs = (queue, seen) => { |
| 53 | while (!queue.isEmpty()) { |
| 54 | /* Time O(V + E) */ |
| 55 | for (let i = queue.size() - 1; 0 <= i; i--) { |
| 56 | /* Time O(W) */ |
| 57 | const node = queue.dequeue(); |
| 58 | |
| 59 | cloneNeighbors(node, seen, queue); /* Space O(N) */ |
| 60 | } |
| 61 | } |
| 62 | }; |
| 63 | |
| 64 | const cloneNeighbors = (node, seen, queue) => { |
| 65 | for (const neighbor of node.neighbors) { |
no test coverage detected