北京建站模板展示_门户建设是什么意思_seo的优化原理_有什么推广的平台

1.所有可达路径

1.1 题目

https://kamacoder.com/problempage.php?pid=1170

1.2 题解

#include <iostream>
#include <vector>
#include <list>
using namespace std;//收集结果数组
vector<vector<int>> result;
//单个路径
vector<int> path;
//递归函数,x代表当前遍历的节点，n代表终点节点
void dfs(vector<vector<int>>& graph, int x, int n)
{//确定终止条件if (x == n){result.push_back(path);return;}//遍历节点x连接的所有节点for (int i = 1; i <= n; i++){if (graph[x][i] == 1){path.push_back(i);dfs(graph, i, n);path.pop_back();}}}int main()
{int nodes;int margins;cin >> nodes >> margins;int s;int t;//构造邻接矩阵vector<vector<int>> graph(nodes + 1, vector<int>(nodes + 1, 0));for (int i = 0; i < margins; ++i){cin >> s >> t;//存储graph[s][t] = 1;}path.push_back(1);dfs(graph, 1, nodes);// 输出结果if (result.size() == 0) cout << -1 << endl;for (const vector<int>& pa : result) {for (int i = 0; i < pa.size() - 1; i++) {cout << pa[i] << " ";}cout << pa[pa.size() - 1] << endl;}
}