深度优先算法生成迷宫——Python实现

最新推荐文章于 2025-03-01 22:57:37 发布

crystal_tyan

最新推荐文章于 2025-03-01 22:57:37 发布

阅读量6k

点赞数 1

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/crystal_tyan/article/details/42523861

版权

该博客介绍了如何使用Python实现深度优先搜索(DFS)算法来生成迷宫。首先初始化一个二维矩阵，设置边界为墙，然后从起点开始，通过随机选择方向并递归地生成未访问的路径，形成连通的迷宫。最后展示生成的迷宫和DFS遍历路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import random

#warning: x and y confusing

sx = 10
sy = 10
dfs = [[0 for col in range(sx)] for row in range(sy)]
maze = [[' ' for col in range(2*sx+1)] for row in range(2*sy+1)]
#1:up 2:down 3:left 4:right
operation = {1:(0,-1),2:(0,1),3:(-1,0),4:(1,0)}
direction = [1, 2, 3, 4]
stack = []

for i in range(2*sx+1):
    if i%2 == 0:
        for j in range(2*sx+1):
            maze[i][j] = '#'
for i in range(2*sy+1):
    if i%2 == 0:
        for j in range(2*sy+1):
            maze[j][i] = '#'

def show(graph):
    for i in graph:
        for j in i:
            print j,
        print

def showRouter(stack):
    RGragh = [[0 for col in range(sx)] for row in range(sy)]
    for (x, y) in stack:
        RGragh[y][x] = 1
    show(RGragh)
    print

def generateMaze(start):
    x, y = start
    dfs[y][x] = 1
    random.shuffle(direction)
    for