10305 - Ordering Tasks-拓扑排序

10305 - Ordering Tasks

 John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task isonly possible if other tasks have already been executed.

Input

The input will consist of several instances of the problem. Each instance begins with a line containingtwo integers, 1 ≤ n ≤ 100 and m. n is the number of tasks (numbered from 1 to n) and m is thenumber of direct precedence relations between tasks. After this, there will be m lines with two integersi and j, representing the fact that task i must be executed before task j.An instance with n = m = 0 will finish the input.

Output

For each instance, print a line with n integers representing the tasks in a possible order of execution.

Sample Input

5 4

1 2

2 3

1 3

1 5

0 0

Sample Output

1 4 2 5 3

#include<iostream>
#include<cstring>
using namespace std;
int G[105][105],vis[105];
int n,m,ans[105],k;
void dfs(int v)
{
	vis[v]=-1;
	for(int i=0;i<n;i++)
		if(G[v][i])
		{
			if(vis[i]==-1)//存在环，无解
			return ;
			else if(!vis[i])
			dfs(i);
		}
	vis[v]=1;
	ans[--k]=v;
}
int main()
{
	while(scanf("%d%d",&n,&m)&&n)
	{
		memset(G,0,sizeof(G));
		memset(vis,0,sizeof(vis));
		for(int i=0;i<m;i++)
		{
			int u,v;
			cin>>u>>v;u--,v--;
			G[u][v]=1;
		}
		k=n;
		for(int i=0;i<n;i++)
		 if(!vis[i]) dfs(i);
		for(int i=0;i<n-1;i++)
		cout<<ans[i]+1<<" ";
		cout<<ans[n-1]+1<<endl;
	}
}