Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- visited = [False] * (n + 1)
- prev = [None] * (n + 1)
- def dfs(start, visited, prev, g):
- visited[start] = True
- for u in g[start]:
- if not visited[u]:
- prev[u] = start
- dfs(u)
- dfs(start, visited, prev, g)
Add Comment
Please, Sign In to add comment
