Depth first search Python

See more:

Python

algorithm

I wrote this code to find a path between two nodes (using dfs algorithm) , and there is an error in it could you please help me

What I have tried:

graph = {

'S':['D', 'A', 'B' ],

'A':['C' ],

'B' :['D'],

'C' :['G', 'D' ],

'D':['G'] }

def dfs ( graph , start , goal ) :

visited = [ ]

stack = [ [ start ] ]

while stack :

path = stack.pop()

node = path [ -1 ]

if node in visited :

continue

visited.append ( node )

if node == goal :

return path

else :

adjacent_nodes = graph.get ( node , [ ])

for node2 in adjacent_nodes :

if node2 not in path :

new_path = list ( path)

new_path.append ( node2 )

stack.append ( new_path )

Solution = dfs(graph, 'S', 'G')

Print ( 'solution is :', Solution)