(numCourses, prerequisites)
| 17 | }); |
| 18 | |
| 19 | var buildGraph = (numCourses, prerequisites) => { |
| 20 | const { graph, path } = initGraph(numCourses); |
| 21 | |
| 22 | for (const [src, dst] of prerequisites) { |
| 23 | const neighbors = graph[dst] || []; |
| 24 | |
| 25 | neighbors.push(src); |
| 26 | |
| 27 | graph[dst] = neighbors; |
| 28 | } |
| 29 | |
| 30 | return { graph, path }; |
| 31 | }; |
| 32 | |
| 33 | var hasPath = (numCourses, graph, path) => { |
| 34 | for (let course = 0; course < numCourses; course++) { |