简单BFS算法 python实现（未注释）21.10.1

def seller(people):
    if people=='刘庄村':
        return 1
    return 0

def Search(search):
    i=0
    searched=[]

    while(search):
        people = search.popleft( )

        if people not in searched:

            #print(people)
            if seller(people):
                print(people,"找到啦")
                Research( "双子峰", people )
                #print( "i=", i )

                return 1
            else:
                #print (people,"不是seller")
                searched=people

                #print( "len(graph[people])=", len(graph[people]) )

                if graph[people]:
                    i+=1


                    search+=graph[people]

    print("找不到")
    return 0

def Research(head,tail):
     target=tail
     i=0
     name_graph=[]


     for name in graph:
        name_graph.append(name)



     print (name_graph)