fork download
copy 
  1. graph = {'A': ['B', 'C', 'E'],
  2. 'B': ['A','D', 'E'],
  3. 'C': ['A', 'F', 'G'],
  4. 'D': ['B'],
  5. 'E': ['A', 'B','D'],
  6. 'F': ['C'],
  7. 'G': ['C']}
  8. def bfs(graph, initial):
  9.   visited = []
  10.   queue = [initial]
  11.   while queue:
  12.     node = queue.pop(0)
  13.     if node not in visited:
  14.       visited.append(node)
  15.       neighbours = graph[node]
  16.       for neighbour in neighbours:
  17.         queue.append(neighbour)
  18.   return visited  	
  19. print(bfs(graph,'A'))
Success #stdin #stdout 0.04s 9132KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
['A', 'B', 'C', 'E', 'D', 'F', 'G']
https://ideone.com/4akGW3
language:
Python 3 (python  3.9.5)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!