(queue, graph, maxTime)
| 45 | }; |
| 46 | |
| 47 | var checkNeighbors = (queue, graph, maxTime) => { |
| 48 | const [node, time] = queue.dequeue(); |
| 49 | |
| 50 | const canUpdate = time < maxTime[node]; |
| 51 | if (!canUpdate) return; |
| 52 | |
| 53 | maxTime[node] = time; |
| 54 | |
| 55 | for (const [dst, weight] of graph[node]) { |
| 56 | queue.enqueue([dst, weight + time]); |
| 57 | } |
| 58 | }; |
| 59 | |
| 60 | var checkAns = (maxTime) => { |
| 61 | const max = Math.max(...maxTime); |