图的广度优先搜索的python代码

当然，我可以为您提供图的广度优先搜索的Python代码。以下是示例代码：

from queue import Queue

def bfs(graph, start):
    visited = set()
    queue = Queue()

    visited.add(start)
    queue.put(start)

    while not queue.empty():
        vertex = queue.get()
        print(vertex)

        for neighbor in graph[vertex]:
            if neighbor not in visited:
                visited.add(neighbor)
                queue.put(neighbor)

# 以下是示例图

graph = {
    'A': ['B', 'C'],
    'B': ['D', 'E'],
    'C': ['F'],
    'D': [],
    'E': ['F'],
    'F': []
}

bfs(graph, 'A')

希望这可以帮助您解决您的问题！