模版:有向图的拓扑排列
#include <iostream>
#include <cstring>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int d[N];
int h[N], e[N], ne[N], idx;
void add_edge(int a, int b) {
e[idx] = b;
ne[idx] = h[a];
h[a] = idx ++ ;
}
int q[N], hh, tt = -1;
bool topo_sort() {
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]) q[ ++ tt] = j;
}
}
return tt == n - 1;
}
int main() {
memset(h, -1, sizeof h);
cin >> n >> m;
for (int i = 0; i < m; i ++ ) {
int a, b;
cin >> a >> b;
add_edge(a, b);
d[b] ++ ;
}
if (topo_sort()) {
for (int i = 0; i < n; i ++ )
cout << q[i] << ' '