如何DFS一个二维数组来记录从最左边的列到最右边的列的路径？

def dfs(grid, visited, x, y, path):
    visited[x][y] = True
    path.append((x, y))

    if y == len(grid[0]) - 1:
        print("找到一条路径：", path)

    else:
        if x - 1 >= 0 and not visited[x - 1][y]:
            dfs(grid, visited, x - 1, y, path)
        if x + 1 < len(grid) and not visited[x + 1][y]:
            dfs(grid, visited, x + 1, y, path)
        if y + 1 < len(grid[0]) and not visited[x][y + 1]:
            dfs(grid, visited, x, y + 1, path)

    visited[x][y] = False
    path.pop()

def dfs_2d_array(grid):
    m, n = len(grid), len(grid[0])
    visited = [[False] * n for _ in range(m)]

    for i in range(m):
        dfs(grid, visited, i, 0, [])

# 示例调用
grid = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]
dfs_2d_array(grid)