(graph, indegree)
| 138 | }; |
| 139 | |
| 140 | var topologicalSort = (graph, indegree) => { |
| 141 | const queue = searchGraph(graph, indegree); |
| 142 | |
| 143 | return bfs(graph, indegree, queue); |
| 144 | }; |
| 145 | |
| 146 | var isSource = (count) => count === 0; |
| 147 |
no test coverage detected