day50|98. 所有可达路径

广度优先搜索(Breadth-first search）

深度优先搜索(Depth-first search)

98. 所有可达路径

#include<vector>
#include<iostream>
 using namespace std;
 
 void dfs(vector<vector<int>> &paths, int x, int n, vector<vector<int>>& results, vector<int> result){
     if(x == n){
         results.push_back(result);
     }
     for(int i = 1; i <= n; i++){
        if(paths[x][i] == 1){
            result.push_back(i);
            dfs(paths, i, n, results, result);
            result.pop_back();
        }
     }
 }
 
 int main(){
     int m = 0, n = 0;
     cin >> n >> m;
     vector<vector<int>> paths(n + 1, vector<int>(n + 1));
     int s = 0, t = 0;
     for(int i = 0; i < m; i++){
         cin >> s >> t;
         paths[s][t] = 1;
     }
     vector<vector<int>> results;
     vector<int> result({1});
     dfs(paths, 1, n, results, result);
     if (results.size() == 0) cout << -1 << endl;
     for(vector<int> &ans : results){
         int  ansN = ans.size();
         for(int i = 0; i < ansN - 1; i++){
             cout << ans[i] << " ";
         }
         cout << ans[ansN - 1] << endl;
     }
     
 }