求拓扑排序,题目保证有结果,拓扑排序的关键词是入度,过程和广度优先搜索有点类似,同时是判断有向图是不是无环的一个方法
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int n, m;
int tot, ver[105], head[1005], nxt[1005], indegree[105];
vi ans;
void add(int x, int y) {
ver[++tot] = y;
nxt[tot] = head[x]; head[x] = tot;
}
void topologicalsort() {
queue<int> q;
for (int i = 1; i <= n; i++) {
if (!indegree[i]) q.push(i);
}
while (!q.empty()) {
int now = q.front();
q.pop();
ans.pb(now);
for (int i = head[now]; i; i = nxt[i]) {
int y = ver[i];
if (--indegree[y] == 0) q.push(y);
}
}
for (int i = 0; i < sz(ans); i++) cout << ans[i] << " ";
cout << endl;
ans.clear();
}
int main() {
while (cin >> n >> m && n) {
memset(indegree, 0, sizeof(indegree));
tot = 0;
memset(head, 0, sizeof(head));
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
add(a, b);
indegree[b]++;
}
topologicalsort();
}
return 0;
}