Lịch Học MônCourse Schedule

// Kahn's BFS (Topological Sort) — trực quan hơn với in-degree
function canFinishBFS(numCourses: number, prerequisites: number[][]): boolean {
  const inDegree = new Array(numCourses).fill(0)
  const adj: number[][] = Array.from({ length: numCourses }, () => [])

  for (const [a, b] of prerequisites) {
    adj[b].push(a)
    inDegree[a]++
  }

  const queue: number[] = []
  for (let i = 0; i < numCourses; i++) {
    if (inDegree[i] === 0) queue.push(i)
  }

  let processed = 0
  while (queue.length > 0) {
    const node = queue.shift()!
    processed++
    for (const next of adj[node]) {
      inDegree[next]--
      if (inDegree[next] === 0) queue.push(next)
    }
  }
  return processed === numCourses
}