【数据结构】 Python实现广度优先搜索BFS

代码如下

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 BFS(g, v):
    visit(v)
    visited[v] = True
    while(queue != []):
        v = queue[0]
        queue.pop(0)
        w = FirsNeighbor(v)
        while(w >= 0):
            if(visited[w] == False):
                visit(w)
                visited[w] = True
                queue.append(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])
    for i in range(g.shape[0]):
        if(visited[i] != 1):
            queue = [i]
            BFS(g, i)
            print("\n")
        
    

运行结果