Revise this code :

graph={

'A':['B','C','D'],

'B':['E','F'],

'C':['G','H','I'],

'D':['J'],

'E':['K','L'],

'F':['M'],

'G':[],

'H':['N','O'],

'I':[],

'J':['P','Q'],

'K':[],

'L':[],

'M':[],

'N':[],

'O':['R','S','T'],

'P':[],

'Q':['U'],

'R':[],

'S':['V'],

'T':[],

'U':[],

'V':[]

}

defbfs(graph,root):

visited=[]

queue=[root]

whilequeue:

node=queue.pop(0)

ifnodenotinvisited:

visited.append(node)

queue+=graph[node]

returnvisited

print(*bfs(graph,'A'))

To get this BFS OUTPUT :

\f