【AcWing——宽度优先搜索-拓扑排序】AcWing 848. 有向图的拓扑排序

AcWing 848. 有向图的拓扑排序

拓扑排序是宽度优先搜索的一个很重要的应用场景，下面使用宽度优先搜索代码实现。

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;

int n, m;
int h[N], e[N], ne[N], idx = 0;
int q[N], degIn[N];//q为数组模拟队列;degIn为入度

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

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