Topological Sort - Parallel Courses (Minimum Semesters)
The following code attempts to compute the minimum semesters to complete all courses using BFS topological sort. Identify the bug that causes incorrect results or infinite loops.
from collections import deque, defaultdict
def min_semesters_buggy(n, relations):
graph = defaultdict(list)
indegree = [0] * (n + 1)
for u, v in relations:
graph[u].append(v)
indegree[v] += 1
queue = deque([i for i in range(1, n + 1) if indegree[i] == 0])
semester = 0
processed = 0
while queue:
semester += 1
course = queue.popleft() # Bug here: processing one course per semester
processed += 1
for nei in graph[course]:
indegree[nei] -= 1
if indegree[nei] == 0:
queue.append(nei)
return semester if processed == n else -1
