def search_graph(network, start):
need_check = [start]
expansion = []
while need_check:
person = need_check.pop(-1) # -1 为深度优先 0 为广度优先
if person in expansion: continue
need_check += network.get(person,[])
expansion.append(person)
return expansion
social_network = {'小张': ['老王', '小西', '小刘'], '小西': ['张三','六六','李四'], '六六':['小七', '奥巴马']}
print(search_graph(social_network, '小张'))
在我理解,深度优先和广度优先都有一定的随机性,从起始点A遍历都是按一定顺序遍历,深度遍历为如果你遍历的对象B有子节点,则优先遍历B子节点的信息,然后再遍历A节点的其他节点信息,而广度优先即先遍历完A节点的所有自节点,再遍历A的子节点的子节点。