Python中如何实现广度优先搜索算法进行查找

# 定义图的节点和边
graph = {
    "pidancode.com": ["Python", "Java", "C++"],
    "Python": ["Web", "Data"],
    "Java": ["JSP", "Spring"],
    "C++": ["OpenGL"],
    "Web": ["Flask", "Django"],
    "Data": ["Pandas", "Numpy"],
    "JSP": ["Servlet"],
    "Spring": ["Spring MVC"],
    "Flask": [],
    "Django": [],
    "Pandas": [],
    "Numpy": [],
    "Servlet": [],
    "Spring MVC": [],
    "皮蛋编程": ["Python", "Java", "C++"]
}

# 定义广度优先搜索函数
def bfs(graph, start, end):
    # 创建一个队列来存储需要遍历的节点
    queue = []
    # 将起始节点加入队列中
    queue.append(start)
    # 记录已经遍历过的节点，防止循环遍历
    visited = set()
    visited.add(start)

    # 循环队列直到找到目标节点或遍历完所有节点
    while queue:
        # 取出队列的第一个节点
        node = queue.pop(0)
        # 如果找到目标节点，则直接返回路径
        if node == end:
            return " -> ".join(path)
        # 遍历当前节点的所有子节点并加入队列中
        for neighbor in graph[node]:
            if neighbor not in visited:
                visited.add(neighbor)
                queue.append(neighbor)

# 测试代码
start = "pidancode.com"
end = "Django"
path = bfs(graph, start, end)
print(path)  # 输出：pidancode.com -> Python -> Web -> Django