dfs sample

 def dfs(graph,cur,vd):

  if cur not in vd:

    vd.append(cur)

    for nbr in graph[cur]:

      dfs(graph,nbr,vd)

  return vd

graph = [[],[2,3],[4,5],[6,7],[8,],[9,],[],[],[],[]]

vd = []

print(dfs(graph,1,vd))

Output:

[1, 2, 4, 8, 5, 9, 3, 6, 7]