Method dfs

java/0797-all-paths-from-source-to-target.java:11–26

(
        List<List<Integer>> ans,
        int[][] graph,
        List<Integer> list,
        int i
    )

    }

    public void dfs(
        List<List<Integer>> ans,
        int[][] graph,
        List<Integer> list,
        int i
    ) {
        if (i == graph.length - 1) {
            ans.add(new ArrayList<Integer>(list));
            return;
        }
        for (int val : graph[i]) {
            list.add(val);
            dfs(ans, graph, list, val);
            list.remove(list.size() - 1);
        }
    }
}