797. 所有可能的路径

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