https://vjudge.net/problem/UVA-10305
题目:输入为n,m。n表示一共n个数(1到n),m表示一共m条边。边1 2表示1必须在2的前面。
如果有回路,那么输出是不存在的。当然这道题假设输出存在,即输入没有回路。
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<stack>
#include <sstream>
//#include <Eigen/Dense>
//#include <Eigen/Geometry>
//using namespace Eigen;
using namespace std;
int n, m;
const int maxn = 101;
int g[maxn][maxn],vis[maxn];
int ok = 1;
vector<int>r;
//vis[i] = 1,表示结点i正在进行dfs,vis[i] = 2,i的子树已经递归完毕
//图中有回路,当且仅当dfs过程中,当前结点在之前被标记为1,如1->2,2->3,3->1
void dfs(int u)
{
if (!ok)
return;
vis[u] = 1;
for (int i = 1; i <= n; i++)
{
if (g[u][i])
{
if (vis[i] == 1)
{
ok = 0;
return;
}
if (vis[i] == 2)
continue;
dfs(i);
}
}
vis[u] = 2;
r.push_back(u);
return;
}
int main()
{
while (cin >> n >> m)
{
if (m == 0 && n == 0)
break;
ok = 1;
memset(g, 0, sizeof(g));
memset(vis, 0, sizeof(vis));
r.clear();
for (int i = 0; i < m; i++)
{
int u, v;
cin >> u >> v;
g[u][v] = 1;
}
for (int i = 1; i <= n; i++)
{
if (vis[i] != 2)//如果是连通图,直接dfs(1)就可以了。加上循环考虑连通分支
dfs(i);
}
if (!ok)
cout << "not exist" << endl;
else
{
reverse(r.begin(), r.end());
for (int i : r)
cout << i << " ";
cout << endl;
}
}
return 0;
}