Python迷宫BFS最短路径

from collections import deque

def find_shortest_path(maze, start, end):
    rows = len(maze)
    cols = len(maze[0])
    visited = [[False] * cols for _ in range(rows)]
    parents = [[None] * cols for _ in range(rows)]

    queue = deque()
    queue.append(start)
    visited[start[0]][start[1]] = True

    while queue:
        current = queue.popleft()
        if current == end:
            break

        row, col = current
        neighbors = [(row-1, col), (row+1, col), (row, col-1), (row, col+1)]
        for neighbor in neighbors:
            n_row, n_col = neighbor
            if 0 <= n_row < rows and 0 <= n_col < cols and not visited[n_row][n_col] and maze[n_row][n_col] == 1:
                queue.append(neighbor)
                visited[n_row][n_col] = True
                parents[n_row][n_col] = current

    if parents[end[0]][end[1]] is None:
        return None

    path = []
    current = end
    while current != start:
        path.append(current)
        current = parents[current[0]][current[1]]
    path.append(start)
    path.reverse()

    return path