(times, n, k)
| 25 | }); |
| 26 | |
| 27 | var buildGraph = (times, n, k) => { |
| 28 | const { graph, maxTime, queue } = initGraph(n, k); |
| 29 | |
| 30 | for (const [src, dst, weight] of times) { |
| 31 | graph[src].push([dst, weight]); |
| 32 | } |
| 33 | |
| 34 | maxTime[0] = 0; |
| 35 | |
| 36 | return { graph, maxTime, queue }; |
| 37 | }; |
| 38 | |
| 39 | var bfs = (queue, graph, maxTime) => { |
| 40 | while (!queue.isEmpty()) { |
no test coverage detected