GoalScope — detect_cycle_directed (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def detect_cycle_directed(graph):↵
"""Detect cycle in a directed graph using DFS."""↵
visited = set()↵
rec_stack = set()↵
↵
def dfs(v):↵
visited.add(v)↵
rec_stack.add(v)↵
for neighbor in graph.get(v, []):↵
if neighbor in rec_stack:↵
return True↵
if neighbor not in visited and dfs(neighbor):↵
return True↵
rec_stack.remove(v)↵
return False↵
↵
for node in graph:↵
if node not in visited:↵
if dfs(node):↵
return True↵
return False↵
</code>