from collections import deque def bfs(h, l, mg): # print(h) # print(l) # 定义方向 # 左右 上下 directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] # 初始化层序队列 和访问标识 q = deque() q.append((0, 0)) visited = [[False] * (l) for _ in range(h)] visited[0][0] = True # 存储父节点 ...
