(queue, graph, maxTime)
| 37 | }; |
| 38 | |
| 39 | var bfs = (queue, graph, maxTime) => { |
| 40 | while (!queue.isEmpty()) { |
| 41 | for (let level = queue.size() - 1; 0 <= level; level--) { |
| 42 | checkNeighbors(queue, graph, maxTime); |
| 43 | } |
| 44 | } |
| 45 | }; |
| 46 | |
| 47 | var checkNeighbors = (queue, graph, maxTime) => { |
| 48 | const [node, time] = queue.dequeue(); |
no test coverage detected