#!/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")
[笔记]BFS算法的python实现
原文作者:everfight
原文地址: https://www.cnblogs.com/everfight/p/BFS.html
本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。
原文地址: https://www.cnblogs.com/everfight/p/BFS.html
本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。