GoalScope — floyd_warshall (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def floyd_warshall(graph):↵
""" graph is a 2D list representing adjacency matrix """↵
V = len(graph)↵
dist = list(map(lambda i: list(map(lambda j: j, i)), graph))↵
for k in range(V):↵
for i in range(V):↵
for j in range(V):↵
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])↵
return dist↵
</code>