DFS

example_dfs.py

#!/usr/env/python
graph = {
  'A' : ['B','C'],
  'B' : ['D', 'E'],
  'C' : ['F'],
  'D' : [],
  'E' : [],
  'F' : []
}

visited = set()

def dfs(visited, graph, node):
   if node not in visited:
      print(node)
   visited.add(node)

   for neighbour in graph[node]:
      print(f"{node} ->", end=" ")
      dfs(visited, graph, neighbour)

if __name__ == '__main__':
   dfs(visited, graph, 'A')