Topological Sort - Course Schedule II (Topological Order)
In the following snippet of Kahn's Algorithm, which mistake can cause the algorithm to fail or loop infinitely?
```python
from collections import deque, defaultdict
def findOrder(numCourses, prerequisites):
graph = defaultdict(list)
in_degree = [0] * numCourses
for dest, src in prerequisites:
graph[src].append(dest)
in_degree[dest] += 1
queue = deque([i for i in range(numCourses) if in_degree[i] == 0])
order = []
while queue:
node = queue.popleft()
order.append(node)
for neighbor in graph[node]:
in_degree[neighbor] -= 1
if in_degree[neighbor] == 0:
queue.append(neighbor)
if len(order) == numCourses:
return order
else:
return []
```
Which of the following is the most critical bug if the algorithm misbehaves?
