GoalScope — topological_sort (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def topological_sort(graph):↵
"""Kahn's Algorithm for Topological Sorting"""↵
from collections import deque↵
↵
in_degree = {u: 0 for u in graph}↵
for u in graph:↵
for v in graph[u]:↵
in_degree[v] += 1↵
↵
queue = deque([u for u in in_degree if in_degree[u] == 0])↵
topo_order = []↵
↵
while queue:↵
u = queue.popleft()↵
topo_order.append(u)↵
for v in graph[u]:↵
in_degree[v] -= 1↵
if in_degree[v] == 0:↵
queue.append(v)↵
↵
return topo_order if len(topo_order) == len(graph) else []↵
</code>