797. All Paths From Source to Target - LeetCode Solution

class Solution:
    def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]:
        ans = []
        
        def dfs(node, arr):
            if node == len(graph) - 1:
                ans.append(arr)
                return 
            
            for i in range(len(graph[node])):
                dfs(graph[node][i], arr + [graph[node][i]])
        
        dfs(0, [0])
        return ans