(graph, indegree, queue, order)
| 191 | }; |
| 192 | |
| 193 | var checkNeighbors = (graph, indegree, queue, order) => { |
| 194 | const node = queue.dequeue(); |
| 195 | |
| 196 | order.push(node); |
| 197 | |
| 198 | for (const neighbor of graph[node]) { |
| 199 | indegree[neighbor]--; |
| 200 | |
| 201 | const isSource = indegree[neighbor] === 0; |
| 202 | if (isSource) queue.enqueue(neighbor); |
| 203 | } |
| 204 | }; |