Python深度优先算法生成迷宫

本文实例为大家分享了Python深度优先算法生成迷宫，供大家参考，具体内容如下

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 d in direction:
px, py = (x + y for x, y in zip(start, operation[d]))
if px < 0 or px >= sx or py < 0 or py >= sy:
pass
else:
if dfs[py][px] is not 1:
mx = 2*x + 1
my = 2*y + 1
if d == 1:
maze[my-1][mx] = ' '
elif d == 2:
maze[my+1][mx] = ' '
elif d == 3:
maze[my][mx-1] = ' '
elif d == 4:
maze[my][mx+1] = ' '
generateMaze((px,py))
generateMaze((0,0))
show(dfs)
show(maze)

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持脚本之家。

您可能感兴趣的文章:

• Python中的二叉树查找算法模块使用指南
• python实现的二叉树定义与遍历算法实例
• python实现的二叉树算法和kmp算法实例
• Python数据结构与算法之二叉树结构定义与遍历方法详解
• Python算法之求n个节点不同二叉树个数
• Python二叉树的定义及常用遍历算法分析
• Python实现基于二叉树存储结构的堆排序算法示例
• Python编程求解二叉树中和为某一值的路径代码示例
• python数据结构之图深度优先和广度优先实例详解
• Python数据结构与算法之图的广度优先与深度优先搜索算法示例
• python深度优先搜索和广度优先搜索
• Python实现的多叉树寻找最短路径算法示例