797题--图的遍历

class Solution {
public:
    vector<vector<int>> result;
    vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
        vector<int>path;
        dfs(graph,path,0);
        return result;
    }
    void dfs(vector<vector<int>>& graph,vector<int>& path,int s){
        path.emplace_back(s);
        if(s==graph.size()-1){
            result.emplace_back(path);
            path.pop_back();
            return;
        }
        for(auto p:graph[s]){
            dfs(graph,path,p);
        }
        path.pop_back();
    }
};