from collections import deque
graph={'A':['B','C'],'B':['D','E'],'C':['F','G']}
def bfs(graph,start):
queue=deque(start)
visited=[]
last=''
while(queue):
u=queue.popleft()
last=u
for v in graph[u]:
if v not in visited:
visited.append(v)
start,last=last,start
ZnJvbSBjb2xsZWN0aW9ucyBpbXBvcnQgZGVxdWUKCmdyYXBoPXsnQSc6WydCJywnQyddLCdCJzpbJ0QnLCdFJ10sJ0MnOlsnRicsJ0cnXX0KZGVmIGJmcyhncmFwaCxzdGFydCk6CiAgICBxdWV1ZT1kZXF1ZShzdGFydCkKICAgIHZpc2l0ZWQ9W10KICAgIGxhc3Q9JycKICAgIHdoaWxlKHF1ZXVlKToKICAgICAgICB1PXF1ZXVlLnBvcGxlZnQoKQogICAgICAgIGxhc3Q9dQogICAgICAgIGZvciB2IGluIGdyYXBoW3VdOgogICAgICAgICAgICBpZiB2IG5vdCBpbiB2aXNpdGVkOgogICAgICAgICAgICAgICAgdmlzaXRlZC5hcHBlbmQodikKICAgc3RhcnQsbGFzdD1sYXN0LHN0YXJ0ICAgICAgICAgICAgIAogICAgICAgICAgICAgICAgCiAgICAgICAgICAgICAgICAKICAgICAgICAKICAgIAogICAgCg==