Python Prim算法通过遍历墙实现迷宫的生成

import random as rd
import time

def createMaze(a,b): # a:width b:height

startTime=time.time()

maze={}

    for n in range(a*b):
        for face in ["u","d","l","r"]:
            maze[(n,face)]=1

    history=[]
    walls=[]

block=rd.choice(list(maze.keys()))[0]
history.append(block)

    for face in ["u","d","l","r"]:
        walls.append((block,face))

while len(walls)!=0:

        wall=rd.choice(walls)
        twoBlocks=[wall[0]]
        faces=[wall[1]]
        if wall[1]=="u":
            if wall[0]-a<0:
                twoBlocks.append(None)
            else:
                twoBlocks.append(wall[0]-a)
                faces.append("d")
        elif wall[1]=="r":
            if (wall[0]+1)%a!=0:
                twoBlocks.append(wall[0]+1)
                faces.append("l")
            else:
                twoBlocks.append(None)
        elif wall[1]=="l":
            if wall[0]%a!=0:
                twoBlocks.append(wall[0]-1)
                faces.append("r")
            else:
                twoBlocks.append(None)
        elif wall[1]=="d":
            if wall[0]+a>len(maze)/4-1:
                twoBlocks.append(None)
            else:
                twoBlocks.append(wall[0]+a)
                faces.append("u")

        ins=[]
        infaces=[]

        for i,oneBlock in enumerate(twoBlocks):
            if oneBlock in history:
                ins.append(oneBlock)
                infaces.append(faces[i])

        if len(ins)==1:
            mirrorFace=None
            if infaces[0]=="u":
                mirrorFace="d"
            elif infaces[0]=="d":
                mirrorFace="u"
            elif infaces[0]=="r":
                mirrorFace="l"
            elif infaces[0]=="l":
                mirrorFace="r"
            if not (None in twoBlocks):
                maze[(ins[0],infaces[0])]=0
                other=None
                if ins[0]==twoBlocks[0]:
                    other=twoBlocks[1]
                else:
                    other=twoBlocks[0]
                maze[(other,mirrorFace)]=0
                walls.remove(wall)
                history.append(other)
                for face in ["u","l","r","d"]:
                    if maze.get((other,face))==1 and not ((other,face) in walls):
                        walls.append((other,face))
            else:
                walls.remove(wall)
                continue
        elif len(ins)==2:
            walls.remove(wall)

endTime=time.time()

print(f"生成迷宫使用时间：{endTime-startTime}秒")

return maze