拓扑排序模板

#include<cstdio>
#include <iostream>
#include <algorithm>
#include<cstring>
#include<string.h>
#include<vector>
#include<queue>
#include <stdlib.h>
using namespace std;
const int maxn=1e3;
vector<int>vv[maxn];
int indu[maxn];
int vis[maxn];
void topo(int n)
{
    //queue<int>q;    	
    priority_queue<int,vector<int>,greater<int> >q;
	//int count=n;   
	for(int i=1;i<=n;i++)
    {
        if(indu[i]==0)
        {
            q.push(i);
            vis[i]=1;
        }
    }
    int f=0;
    while(q.size())
    {
        //int now=q.front();
		int now=q.top();
        if(f!=0)printf(" ");
        printf("%d",now);
        f++;
        //count--;        q.pop();
        for(int i=0;i<vv[now].size();i++)
        {
            int next=vv[now][i];
            indu[next]--;
            if(indu[next]==0&&!vis[next])
            {
                q.push(next);
                vis[next]=1;
            }
        }
    }
    //if(count==0)printf("YES\n");
    //else printf("NO\n");}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        {
            
            vv[i].clear();
        }
        memset(indu,0,sizeof(indu));
        memset(vis,0,sizeof(vis));
        for(int i=0;i<m;i++)
        {
            int x1,x2;
            scanf("%d%d",&x1,&x2);
            vv[x1].push_back(x2);
            indu[x2]++;
        }
        topo(n);
        printf("\n");
    }
	return 0;
}