bfs implementation using python

BFS: implementation using python,

class A:

def __init__(self):

e,v=input("enter number and edge of graph\n").split()

self.e=int(e)

self.v=int(v)

def aslist(self):

self.g=[[] for i in range(self.v)]

for i in range(self.e):

u,v=map(int,input('enter u,v pair\n').split())

self.g[u].append(v)

self.g[v].append(u)

def bfs(self,s):

que=[]

visited=[0 for i in range(self.v)]

visited[s]=1

que.append(s)

while(que):

u=que.pop(0)

print(u)

for v in self.g[u]:

if(visited[v]!=1):

visited[v]=1

que.append(v)

obj= A()

obj.aslist()

obj.bfs(0)