【数据结构】 Python实现深度优先搜索DFS

最新推荐文章于 2024-02-20 17:04:19 发布

TwinkelStar

最新推荐文章于 2024-02-20 17:04:19 发布

阅读量245

点赞数

文章标签：数据结构 python 深度优先

本文链接：https://blog.csdn.net/qq_48715321/article/details/132311769

版权

代码实现

import numpy as np

def visit(v):
    return print(str(v) + "->",end='')

def FirsNeighbor(v):
    t = -1
    for i in range(g.shape[0]):
        if g[v][i] == 1:
            t = 1
            break
    if(t == 1):
        return i
    else:
        return t
        
def OpenDoor(p):
    if(visited[p] == True):
        return 0
    else:
        return 1

def NextNeighbor(v,w):
    l = []
    for i in range(g.shape[0]):
        if g[v][i] == 1:
            l.append(i)
            
    if(len(l) > 1 and OpenDoor(l[1])):
        return l[1]
    else:
        return -1

def DFS(g, v):
    visit(v)
    visited[v] = True

    w = FirsNeighbor(v)
    while(w >= 0):
        if(visited[w] == False):
            DFS(g,w)
     
        w = NextNeighbor(v,w)
            
            
if __name__ == "__main__":
    
    g =np.array([[0,1,0,0,1,0],
                 [1,0,0,0,0,1],
                 [0,0,0,1,0,1],
                 [0,0,1,0,0,0],
                 [1,0,0,0,0,0],
                 [0,1,1,0,0,0]])
    
    visited = np.zeros(g.shape[0])
    queue = [0]
    DFS(g, 0)