797. 所有可能的路径

class Solution {
public:
    vector<int>path;
    vectorint> >ans;
    void dfs(vectorint>>& graph,int x){
        if(x==graph.size()-1){
            ans.push_back(path);
            return ;
        }
        for(int i=0;isize();i++){
            path.push_back(graph[x][i]);
            dfs(graph,graph[x][i]);
            path.pop_back();
        }
    }
    vectorint>> allPathsSourceTarget(vectorint>>& graph) {
        path.push_back(0);
        dfs(graph,0);
        return ans;
    }
};