算法的工作原理:
- 创建一个队列,用于存储要检查的人
- 从队列中弹出一个人
- 检查这个人是否被检查过
- 检查这个人是否为芒果经销商
- 是:大功告成
- 否:将这个人的所有邻居都加入到队列中
- 回到第二步
- 如果队列为空,就说明没有找到芒果经销商
# -*- encoding: utf-8 -*-
from collections import deque
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("%s is a mango seller!" % person)
return True
else:
search_queue += graph[person]
searched.append(person) # 将这个人标记为检查过
return False
def person_is_seller(man): # 判断是否为芒果经销商
return man[-1] == "m"
if __name__ == "__main__":
graph = {}
graph ["you"] = ["alice", "bob", "claire"]
graph ["bob"] = ["anuj", "peggy"]
graph ["alice"] = ["peggy"]
graph ["claire"] = ["thom", "jonny"]
graph ["anuj"] = []
graph ["peggy"] = []
graph ["thon"] = []
graph ["jonny"] = []
search("you")