You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
25 lines
679 B
25 lines
679 B
7 years ago
|
def graph_dfs(matrix):
|
||
|
|
rows, cols = len(matrix), len(matrix[0])
|
||
|
|
visited = set()
|
||
|
|
directions = ((0, 1), (0, -1), (1, 0), (-1, 0))
|
||
|
|
def dfs(i, j):
|
||
|
|
if (i, j) in visited:
|
||
|
|
return
|
||
|
|
visited.add((i, j))
|
||
|
|
# Traverse neighbors.
|
||
|
|
for direction in directions:
|
||
|
|
next_i, next_j = i + direction[0], j + direction[1]
|
||
|
|
if 0 <= next_i < rows and 0 <= next_j < cols: # Check boundary.
|
||
|
|
# Add any other checking here ^
|
||
|
|
dfs(next_i, next_j)
|
||
|
|
|
||
|
|
for i in range(rows):
|
||
|
|
for j in range(cols):
|
||
|
|
dfs(i, j)
|
||
|
|
|
||
|
|
graph_dfs([
|
||
|
|
[1, 2, 3, 4],
|
||
|
|
[5, 6, 7, 8],
|
||
|
|
[9, 10, 11, 12],
|
||
|
|
])
|