hdu 1285拓扑排序

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
int map[505][505];
int indegree[505];
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int i,a,b;
        memset(map,0,sizeof(map));
        for(i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            map[a][b]=1;
        }

        memset(indegree,0,sizeof(indegree));
        int j;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
                if(map[i][j])
                    indegree[j]++;
        }
        priority_queue<int,vector<int>,greater<int> > q;
        for(i=1;i<=n;i++)
            if(indegree[i]==0)
                q.push(i);
        int flag=1;
        while(!q.empty())
        {
            int t=q.top();
            if(flag)
            {
                printf("%d",t);
                flag=0;
            }
            else
                printf(" %d",t);
            q.pop();
            for(i=1;i<=n;i++)
            {
                if(map[t][i])
                {
                    indegree[i]--;
                    if(indegree[i]==0)
                        q.push(i);
                }
            }
        }
        printf("\n");

    }
    return 0;
}