Topological Sort - All Paths From Source to Target (DAG)
Examine the following DFS code snippet for finding all paths from source to target in a DAG. What is the subtle bug?
```python
def dfs(node, path):
if node == target:
res.append(path)
return
for nei in graph[node]:
path.append(nei)
dfs(nei, path)
path.pop()
```
