GoalScope — strongly_connected_components (Qwen2.5-Coder-32B-Instruct)

GoalScope — strongly_connected_components (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization

↵ <code>↵ def strongly_connected_components(graph):↵ """Kosaraju's Algorithm for finding SCCs"""↵ def dfs(node, visited, stack=None):↵ visited[node] = True↵ for neighbor in graph[node]:↵ if not visited[neighbor]:↵ dfs(neighbor, visited, stack)↵ if stack is not None:↵ stack.append(node)↵ ↵ def reverse_graph(graph):↵ reversed_graph = {v: [] for v in graph}↵ for u in graph:↵ for v in graph[u]:↵ reversed_graph[v].append(u)↵ return reversed_graph↵ ↵ n = len(graph)↵ visited = [False] * n↵ stack = []↵ ↵ for node in range(n):↵ if not visited[node]:↵ dfs(node, visited, stack)↵ ↵ reversed_graph = reverse_graph(graph)↵ visited = [False] * n↵ sccs = []↵ ↵ while stack:↵ node = stack.pop()↵ if not visited[node]:↵ scc = []↵ dfs(node, visited, scc)↵ sccs.append(scc)↵ ↵ return sccs↵ </code>