UVA 10305 - Ordering Tasks

题目大意：给你 n 个任务，m 个任务优先级的比较，求按任务优先级的顺序输出这 n 个任务

解题思路：典型的拓扑排序，先输出入度为 0 的任务，接着输出除了前一个的任务的入度以外，入度为 0 的任务

#include <cstdio>

int main() {
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		int edge[105][105] = {0}, indegree[105] = {0};
		for (int i = 0; i < m; i++) {
			int a, b;
			scanf("%d%d", &a, &b);
			edge[a][b] = 1;
			indegree[b]++;
		}

		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				if (indegree[j] == 0) {
					indegree[j]--;
					printf(i == n ? "%d\n" : "%d ", j);
					for (int k = 1; k <= n; k++)
						if (edge[j][k] == 1)
							indegree[k]--;
					break;
				}
	}
	return 0;
}