Ordering Tasks / 拓扑排序

Ordering Tasks
 

John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only 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 containing  two integers, 1 ≤ n ≤ 100 and m . n is the number of tasks (numbered from 1 to

n ) and m is the number of direct precedence relations between tasks. After this, there will be

m lines with two integers i 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<cstdio>
#include<cstring>
using namespace std;

const int maxn = 1000;
int c[maxn];		//vis数组，-1为有回路， 0为正在访问， 1为已访问 
int topo[maxn], G[maxn][maxn], t, n , m;

bool dfs(int u) {
	c[u] = -1;		//访问标志
	for(int v = 0; v < n; v++) {
		if(G[u][v]) {
			if(c[v] < 0) return false;	//存在有向环，失败退出
			else if(!c[v] && !dfs(v)) return false; 
		}
	} 
	c[u] = 1; topo[--t] = u;
	return true;
}

bool toposort() {
	t = n;
	memset(c, 0, sizeof(c));
	for(int u = 0; u < n; u++) 
		if(!c[u]) if(!dfs(u)) return false;
	return true;
}

int main() {
	while(cin>>n>>m && n) {
		memset(G, 0, sizeof(G));
		for(int i = 0; i < m; i++) {
			int a, b; cin >> a >> b;
			G[a-1][b-1] = 1;
		}
		if(toposort()) {
			for(int i = 0; i < n; i++) {
				if(i != 0) putchar(' '); 
				cout << topo[i]+1 << ' ';
			}
			putchar('\n');
		} else {
			cout << "No" << '\n';
		}
	}
	return 0;
}