拓扑排序模板

struct Topsort {
    int n, m;
    int h[N], e[N], ne[N], idx;
    int d[N];
    int q[N];
    void init()
    {
        scanf("%d%d", &n, &m);
        memset(h, -1, sizeof h);
        for (int i = 0; i < m; i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            add(a, b);

            d[b] ++;
        }
    }
    void add(int a, int b)
    {
        e[idx] = b, ne[idx] = h[a], h[a] = idx++;
    }
    bool topsort()
    {
        int hh = 0, tt = -1;

        for (int i = 1; i <= n; i++)
            if (!d[i])
                q[++tt] = i;

        while (hh <= tt)
        {
            int t = q[hh++];

            for (int i = h[t]; i != -1; i = ne[i])
            {
                int j = e[i];
                if (--d[j] == 0)
                    q[++tt] = j;
            }
        }

        return tt == n - 1;
    }
    vector<int> ouput()
    {   
        vector<int>v;
        if (!topsort()) {
            v.push_back(-1);
        }
        else
        {
            for (int i = 0; i < n; i++) v.push_back(q[i]);
        }
        return v;
    }
}Top;