(graph, indegree, queue = new Queue([]))
| 174 | }; |
| 175 | |
| 176 | var searchGraph = (graph, indegree, queue = new Queue([])) => { |
| 177 | for (const node in graph) { |
| 178 | const isSource = indegree[node] === 0; |
| 179 | if (isSource) queue.enqueue(node); |
| 180 | } |
| 181 | |
| 182 | return queue; |
| 183 | }; |
| 184 | |
| 185 | var bfs = (graph, indegree, queue, order) => { |
| 186 | while (!queue.isEmpty()) { |