DFS - implementation using python recursive method

 DFS - implementation using python

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

edge=int(e)

vertex=int(v)

g=[[] for i in range(vertex)]

visited=[0 for i in range(vertex)]

class A:

def aslist(self):

for i in range(edge):

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

g[u].append(v)

g[v].append(u)

def dfs(self,s):

visited[s]=1

print(s)

for i in g[s]:

if( visited[i]==0):

self.dfs(i)

obj= A()

obj.aslist()

obj.dfs(0)