python 队列+广度优先

from collections import deque

search = deque()
Q = {}
Q["a"] = ["b", "c", "e"]
Q["c"] = ["f"]
Q["b"] = ["k"]
Q["k"] = ["d"]
Q["f"] = []
Q["d"] = []
Q["e"] = []
search += Q["a"]

def judge(t):
    return t == "d"

while search:
    t = search.popleft()
    if judge(t):
        print("a can go to d")
    else:
        search += Q[t]

输出

a can go to d