O(VE) in bfs.py

[harshuljain13]

while queue: node = queue.pop(0) if node not in visited: visited.add(node)

this takes time complexity of O(VE) rather than O(V+E)

[goelakash]

It will be O(V^2). We need a visited array to mark such nodes.