Ordering Tasks

UVA - 10305 

题目：

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 inp

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

 

翻译一下：

约翰有n个任务要做。不幸的是，任务不是独立的，一个任务的执行是独立的只有在其他任务已经执行时才有可能。

输入

输入将包含问题的几个实例。

每个实例以包含的行开始两个整数,1≤n≤100 m . n是任务的数量(编号从1到n)和m任务之间的直接优先关系的数量。

在此之后，将会有m行，有两个整数i和j，表示任务i必须在任务j之前执行。n = m = 0的实例将完成输入。

输出

对于每个实例，以可能的执行顺序打印一行n个整数表示任务。

 

题解：用队列来辅助的一个拓扑排序

代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int MAXN=1e2+10;
int vis[MAXN];
int a[MAXN][MAXN];
int temp[MAXN];
queue<int> que;
int n,m;
void toposort(){
	for(int j=1;j<=n;j++){
		if(vis[j]==0){
			que.push(j);
		}
	}
	int cnt=0;
	while(!que.empty()){
		int t=que.front();
		que.pop();
		temp[++cnt]=t;
		for(int j=1;j<=n;j++){
			if(a[t][j]==1){
				vis[j]--;
				if(vis[j]==0){
					que.push(j);
				}
			}
		}
	}
	for(int i=1;i<=cnt;i++){
		printf("%d",temp[i]);
		if(i!=cnt) printf(" ");
		else printf("\n");
	}
}
int main(){
	int x,y;
	while(~scanf("%d %d",&n,&m)&&(n||m)){  //不写成（m||n）会wa掉
		memset(a,0,sizeof(a));
		memset(vis,0,sizeof(vis));
		memset(temp,0,sizeof(temp));
		for(int i=1;i<=m;i++){
			scanf("%d %d",&x,&y);
			if(a[x][y]==0){
				a[x][y]=1;
				vis[y]++;
			}
		}
		toposort();
	}
    return 0;
}