algo Code Beispiel
graph = {
"A": ["B", "C"],
"B": ["D", "E"]
}
from collections import deque
def bfs(graph, start):
visited = set()
queue = deque([start])
while queue:
node = queue.popleft()
if node not in visited:
print(node)
visited.add(node)
neighbors = graph[node]
queue.extend(neighbors)