(numCourses, prerequisites)
| 22 | }); |
| 23 | |
| 24 | var buildGraph = (numCourses, prerequisites) => { |
| 25 | const { graph, color, isDirectedAcyclicGraph, topologicalOrder } = |
| 26 | initGraph(numCourses); |
| 27 | |
| 28 | for (const [src, dst] of prerequisites) { |
| 29 | const neighbors = graph[dst] || []; |
| 30 | |
| 31 | neighbors.push(src); |
| 32 | graph[dst] = neighbors; |
| 33 | } |
| 34 | |
| 35 | return { graph, color, isDirectedAcyclicGraph, topologicalOrder }; |
| 36 | }; |
| 37 | |
| 38 | var search = ( |
| 39 | numCourses, |