(graph, seen, minHeap, maxTime = 0)
| 98 | }; |
| 99 | |
| 100 | const getTime = (graph, seen, minHeap, maxTime = 0) => { |
| 101 | while (!minHeap.isEmpty()) { |
| 102 | const [node, cost] = minHeap.dequeue().element; |
| 103 | |
| 104 | if (seen.has(node)) continue; |
| 105 | seen.add(node); |
| 106 | |
| 107 | maxTime = Math.max(maxTime, cost); |
| 108 | checkNeighbors(graph, node, cost, seen, minHeap); |
| 109 | } |
| 110 | |
| 111 | return maxTime; |
| 112 | }; |
| 113 | |
| 114 | var checkNeighbors = (graph, src, srcCost, seen, minHeap) => { |
| 115 | for (const [dst, dstCost] of graph[src]) { |
no test coverage detected