Python implementation of dfs and bfs

DFS

from collections import defaultdict
 
class Graph:
 
    def __init__(self):
         self.graph = defaultdict(list)
 
    def addEdge(self,u,v):
        self.graph[u].append(v)

    def RecurDFS(self,v,visited):
 
        visited[v]= True
        #showing visited vertex
        print(v + ' ')
 
        for i in self.graph[v]:
            if visited[i] == False:
                self.RecurDFS(i, visited)
 
    def DFS(self,v):
        visited = [False]*(len(self.graph))
        self.RecurDFS(v,visited)

 
#Creating a graph
randomGraph = Graph()
randomGraph.addEdge(0, 3)
randomGraph.addEdge(2, 0)
randomGraph.addEdge(3, 1)
 
randomGraph.DFS(2)