Python数据结构（深度优先搜索、广度优先搜索）

最新推荐文章于 2024-05-06 14:57:26 发布

_te_amo

最新推荐文章于 2024-05-06 14:57:26 发布

阅读量149

点赞数

文章标签： python 数据结构

本文链接：https://blog.csdn.net/m0_74268288/article/details/131774593

版权

栈和队列的应用：迷宫问题

栈：深度优先搜索

maze=[
[1,1,1,1,1,1,1,1,1,1],
[1,0,0,1,0,0,0,1,0,1],
[1,0,0,1,0,0,0,1,0,1],
[1,0,0,0,0,1,1,0,0,1],
[1,0,1,1,1,0,0,0,0,1],
[1,0,0,0,1,0,0,0,0,1],
[1,0,1,0,0,0,1,0,0,1],
[1,0,1,1,1,0,1,1,0,1],
[1,1,0,0,0,0,0,0,0,1],
[1,1,1,1,1,1,1,1,1,1]
]

dirs=[
lambda x,y:(x+1,y),
lambda x,y:(x-1,y),
lambda x,y:(x,y-1),
lambda x,y:(x,y+1)
]

def maze_path(x1,y1,x2,y2):
    stack=[]
    stack.append(x1,y1)
    while len(stack)>0:
        curNode=stack[-1]    #当前节点
        if curNode[0]==x2 and curNode[1]==y2:    #走到终点
            for p in stack:
                print(p)
            return True
        for dir in dirs:    #x,y的四个方向
            nextNode=dir(curNode[0],curNode[1])
            if maze[nextNode[0]][nextNode[1]]==0：    #如果下一个节点可以走
                stack.append(nextNode)
                maze[nextNode[0]][nextNode[1]]=2    #2表示已经走过
                break
        else:
            maze[nextNode[0]][nextNode[1]]=2
            stack.pop()
    else:
        print('没有路')
        return False

队列：广度优先搜索

from collections import deque
maze=[
[1,1,1,1,1,1,1,1,1,1],
[1,0,0,1,0,0,0,1,0,1],
[1,0,0,1,0,0,0,1,0,1],
[1,0,0,0,0,1,1,0,0,1],
[1,0,1,1,1,0,0,0,0,1],
[1,0,0,0,1,0,0,0,0,1],
[1,0,1,0,0,0,1,0,0,1],
[1,0,1,1,1,0,1,1,0,1],
[1,1,0,0,0,0,0,0,0,1],
[1,1,1,1,1,1,1,1,1,1]
]

dirs=[
lambda x,y:(x+1,y),
lambda x,y:(x-1,y),
lambda x,y:(x,y-1),
lambda x,y:(x,y+1)
]

def print_r(path):
    curNode=path[-1]
    realpath=[]
    while curNode[2]==-1:
        realpath.append(curNode[0:2])
        curNode=path[curNode[2]]
    realpath.append(curNode[0:2])    #起点
    realpath.reverse()
    for node in realpath:
        print(node)

def maze_path_queue(x1,y1,x2,y2):
    queue=deque()
    queue.append(x1,y1,-1)
    path=[]
    while len(queue)>0:
        curNode=queue.pop()
        path.append(curNode)
        if curNode[0]==x2 and curNode[1]==y2:    #终点
            print_r(path)
            return True
        for dir in dirs:
            nextNode=dir(curNode[0],curNode[1])
            if maze[nextNode[0]][nextNode[1]]==0:
                queue.append((curNode[0],curNode[1],len(path)-1))    #后续节点入队，记录哪个节点带它来的
                maze[nextNode[0]][nextNode[1]]=2    #标记已经走过
    else:
        print('没有路')
        return False