Im supposed to take this Breadth First Search I've written and convert it to a Depth first search. I my understanding is I should only have to change one or two lines of code but i don't which or what to

def bfs(begin, end, grid): #begin the search Clist = [] #closed list holds nodes that have already been searched Olist = [] #open list are nodes that can still be searched current = Node(begin,None) # holds the current position

Olist.append(current) while (len(Olist)>0 and current.value != end): for node in Olist: print(node.value) print() current = Olist.pop(0) Clist.append(current) if (current.value != end): expandNode (current, grid, Clist, Olist) print(current.value) path=[]

setPath(current, path) print(path)