题意:告诉你做一件事情,必须先做哪件事情,最后让你给出个顺序
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int G[110][110],n,m,a,b;
int vis[110],c[110],topo[110],t;
bool dfs(int u)
{
vis[u] = -1 ; //正在被访问
for (int v=1 ; v <= n ; v++)
{
if (G[u][v])
if (vis[v] == -1) //存在有向环,失败退出
return false;
else if (!vis[v] && !dfs(v))
return false;
}
vis[u] = 1 ;
topo[--t] = u; //我们是按事情从小到大排列的
return true;
}
bool topoSort()
{
t = n;
memset(vis,0,sizeof(vis));
for (int u = 1 ; u <= n ; u++)
if (!vis[u] && !dfs(u)) //没被访问且无法构成序列
return false;
return true;
}
int main()
{
while (scanf("%d %d",&n,&m) && n+m)
{
memset(G,0,sizeof(G));
for (int i = 0 ; i < m ; i++)
{
scanf("%d %d",&a,&b);
G[a][b] = 1 ;
}
if (topoSort())
{
printf("%d",topo[0]);
for(int i = 1 ;i < n ; i++)
printf(" %d",topo[i]);
printf("\n");
}
}
return 0;
}