We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 186d688 commit f439466Copy full SHA for f439466
utilities/python/graph_dfs.py
@@ -28,7 +28,6 @@ def graph_dfs_diagonals_and_boundary_wrap(matrix):
28
def dfs(i, j):
29
if (i, j) in visited:
30
return
31
- print(matrix[i][j])
32
visited.add((i, j))
33
for direction in directions:
34
# Change 2: No more boundary, use modulo to allow traversal that exceed boundaries to wrap around.
0 commit comments