GoalScope — dfs (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
<code>↵ def dfs(graph, start):↵ """Depth-First Search algorithm."""↵ visited = set()↵ stack = [start]↵ while stack:↵ vertex = stack.pop()↵ if vertex not in visited:↵ visited.add(vertex)↵ stack.extend([neighbor for neighbor in graph[vertex] if neighbor not in visited])↵ return visited</code>