(visited, graph, node)
| 12 | visited = set() # Set to keep track of visited nodes. |
| 13 | |
| 14 | def dfs(visited, graph, node): |
| 15 | if node not in visited: |
| 16 | print (node, end=" ") |
| 17 | visited.add(node) |
| 18 | for neighbour in graph[node]: |
| 19 | dfs(visited, graph, neighbour) |
| 20 | |
| 21 | # Driver Code |
| 22 | dfs(visited, graph, 'A') |