思路:从入度为0的点开始寻找,找到以后放入ans,去掉与该点相邻的所有边。继续寻找第二个入度为0的点,依次类推。
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int MAX_V = 101;
int V, m;
vector<int> map[MAX_V];
int deg[MAX_V];
queue<int> ans;
void topo() {
queue<int> q;
for (int i = 1; i <= V; i++) {
if (!deg[i]) {
q.push(i);
}
}
while (q.size()) {
int tmp = q.front();
q.pop();
ans.push(tmp);
for (auto i : map[tmp]) {
deg[i]--;
if (!deg[i])
q.push(i);
}
}
}
int main() {
cin >> V >> m;
memset(deg, 0, sizeof(deg));
while (m--) {
int a, b;
cin >> a >> b;
map[a].push_back(b);
deg[b]++;
}
topo();
while (ans.size()) {
cout << ans.front() << " ";
ans.pop();
}
return 0;
}