UVA - 10305（拓扑排序）

https://vjudge.net/problem/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 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

题目思路：

有很多任务 但是有些任务有先后顺序 要求输出做任务的顺序

显然用拓扑排序

AC代码：

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 0X3f3f3f3f ;

int main()
{
//    freopen("in.txt","r",stdin);
    int n,m,parent[105];
    vector <int> child[105];
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        if(n==0 && m==0)break;
        int a,b;
        for(int i=0 ; i<n ; i++)
            child[i].clear();
        memset(parent,0,sizeof(parent));
        for(int i=0 ; i<m ; i++)
        {
            scanf("%d %d",&a,&b);
            child[a].push_back(b);
            parent[b]++;
        }

        for(int i=1 ; i<=n ; i++)
        {
            for(int j=1 ; j<=n ; j++)
            {
                if(parent[j]==0)
                {
                    if(i==1)printf("%d",j);
                    else printf(" %d",j);
                    for(int k=0 ; k<child[j].size() ; k++)
                        parent[child[j][k]]--;
                    child[j].clear();
                    parent[j]=maxn;
                    break;
                }
            }
        }
        printf("\n");
    }
    return 0;
}