代码随想录day50 98. 所有可达路径

代码随想录day50 98. 所有可达路径

98. 所有可达路径

代码随想录

#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> result;
vector<int> path;

void dfs(vector<vector<int>> &graph, int x, int n) {
    if (x == n) {
        result.push_back(path);
        return;
    }
    for (int i = 1; i <= n; i++) {
        if (graph[x][i] != 0) {
            path.push_back(i);
            dfs(graph, i, n);
            path.pop_back();
        }
    }
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> graph(N + 1, vector<int>(N + 1, 0));
    int s, t;
    for (int i = 0; i < M; i++) {
        cin >> s >> t;
        graph[s][t] = 1;
    }
    path.push_back(1);
    dfs(graph, 1, N);
    if (result.empty()) {
        cout << -1;
    }
    for (auto & pa : result) {
        for (int i = 0; i < pa.size() - 1; i++) {
            cout << pa[i] << " ";
        }
        cout << pa[pa.size() - 1] << "\n";
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

vector<vector<int>> result;
vector<int> path;

void dfs(vector<list<int>> &graph, int x, int n) {
    if (x == n) {
        result.push_back(path);
        return;
    }
    for (int i : graph[x]) {
        path.push_back(i);
        dfs(graph, i, n);
        path.pop_back();
    }
}


int main() {
    int N, M, s, t;
    cin >> N >> M;
    vector<list<int>> graph(N + 1, list<int>());
    while(M--) {
        cin >> s >> t;
        graph[s].push_back(t);
    }
    path.push_back(1);
    dfs(graph, 1, N);
    if (result.empty()) {
        cout << -1;
    }
    for (auto & pa : result) {
        for (int i = 0; i < pa.size() - 1; i++) {
            cout << pa[i] << " ";
        }
        cout << pa[pa.size() - 1] << "\n";
    }
    return 0;
}