848. 有向图的拓扑序列

AcWing题目链接

拓扑排序

如果用数组模拟队列的话，可以直接输出拓扑序列
注意队尾是从-1开始

#include <iostream>
#include <cstring>
using namespace std;
const int N = 1e5+5;
int h[N], e[N], ne[N];
int q[N], d[N]={0};
int idx = 0;
int n, m;

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];
            d[j]--;
            if(d[j]==0){
                q[++tt] = j;
            }
        }
    }
    return tt == n - 1;
}

int main(){
    int a, b;
    memset(h, -1, sizeof h);
    cin>>n>>m;
    for(int i = 0; i < m; i++){
        cin>>a>>b;
        add(a, b);
        d[b]++;
    }
    if(topsort()){
        for(int i = 0; i < n; i++){
            printf("%d ", q[i]);
        }
        puts("");
    }else puts("-1");
    return 0;
}