1
class Solution {
2
public:
3
    vector<vector<int>> g, res;
4
    vector<int> path;
5
    int n ;
6

7
    vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
8

9
        g = graph;
10
        n = graph.size();
11

12
        path.push_back(0);
13
        dfs(0);
14

15
        return res;
16
    }
17

18
    void dfs(int u) {
19

20
        if(u == n - 1) {
21
            res.push_back(path);
22
            return ;
23
        }
24

25
        for(auto& v : g[u]) {
26
            path.push_back(v);
27
            dfs(v);
28
            path.pop_back();
29
        }
30
    }
31
};