GoalScope — topological_sort_dfs (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def topological_sort_dfs(graph):↵
"""Perform Topological Sort of a given directed acyclic graph using Depth First Search."""↵
def dfs(node):↵
visited[node] = True↵
for neighbor in graph[node]:↵
if not visited[neighbor]:↵
dfs(neighbor)↵
stack.append(node)↵
↵
visited = {node: False for node in graph}↵
stack = []↵
for node in graph:↵
if not visited[node]:↵
dfs(node)↵
return stack[::-1]↵
↵
Example usage:↵
graph = {↵
'A': ['C'],↵
'B': ['C', 'D'],↵
'C': ['E'],↵
'D': ['F'],↵
'E': ['H', 'F'],↵
'F': ['G'],↵
'G': [],↵
'H': []↵
}↵
↵
print(topological_sort_dfs(graph))↵
</code>