All paths from source to target

class Solution {
public:

    void dfs(vector<vector<int>>& graph,vector<vector<int>> &ans,vector<int> curr, int node, int n){

        curr.push_back(node);

        if(node==n-1){
            ans.push_back(curr);
            return;
        }

        for(int i = 0; i<graph[node].size(); i++){

            int newNode= graph[node][i];

            dfs(graph, ans, curr, newNode, n);


        }

        return;

    }

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

        vector<vector<int>> ans;
        vector<int> curr;


        dfs(graph, ans, curr, 0, graph.size());


        return ans;

    }
};