[笔记]BFS算法的python实现

最新推荐文章于 2024-10-10 09:26:55 发布

转载最新推荐文章于 2024-10-10 09:26:55 发布 · 210 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/everfight/p/BFS.html

文章标签：

#python

本文通过一个具体的社交网络示例，展示了如何使用BFS（广度优先搜索）算法来查找特定条件的人，例如芒果销售商。文章深入浅出地讲解了BFS算法的工作原理，并提供了Python代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#!/usr/bin/env python
# -*- coding:utf-8 -*-

graph = {}
graph["you"] = ["alice", "bob", "claire"]
graph["bob"] = ["anuj", "peggy"]
graph["alice"] = ["peggy"]
graph["anuj"] = []
graph["peggy"] = []
graph["thom"] = []
graph[jonny] = []


def person_is_seller(name):
    return name[-1] == 'm'


def search(name):
    search_queue = deque()
    search_queue += graph[name]
    searched = []
    while search_queue:
        person = search_queue.popleft()
        if person not in searched:
            if person_is_seller(person):
                print(person + " is a mango seller!")
                return True
            else:
                search_queue += graph[person]
                searched.append(person)
    return False

    
search("you")

转载于:https://www.cnblogs.com/everfight/p/BFS.html