关于拓扑排序

//广搜迭代
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;

struct edge {
	int e, next;
};
edge edg[100005];
int n, m, head[105], in_degree[105], ans[105], cnt;

int main() {
	memset(head, -1, sizeof(head));
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		edg[i].e = b;
		edg[i].next = head[a];
		head[a] = i;
		in_degree[b]++;
	}
	queue<int> que;
	for (int i = 1; i <= n; i++) {
		if (in_degree[i] == 0) que.push(i);
	}
	while (!que.empty()) {
		int temp = que.front();
		que.pop();
		ans[cnt++] = temp;
		if (cnt == n) {
			for (int i = 0; i < n; i++) {
				cout << ans[i] << " ";
			}
			cout << endl;
			return 0;
		}
		for (int i = head[temp]; i != -1; i = edg[i].next) {
			int e = edg[i].e;
			in_degree[e]--;
			if (in_degree[e] == 0) que.push(e);
		}
	}
	cout << "have loop" << endl;
	return 0;
}

/*
7 8
1 3
1 4
2 4
2 6
3 6
4 5
6 7
5 7
*/

//深搜递归
/*
#include <iostream>
#include <vector>
using namespace std;
int n, m, ans[105], in_degree[105], mark[105];

void func(int now, vector<vector<int> >& edg) {
	if (now == n + 1) {
		for (int i = 1; i <= n; i++) {
			cout << ans[i] << " ";
		}
		cout << endl;
		return;
	}
	for (int i = 1; i <= n; i++) {
		if (in_degree[i] == 0 && mark[i] == 0) {
			ans[now] = i;
			mark[i] = 1;
			for (int j = 0; j < edg[i].size(); j++) {
				in_degree[edg[i][j]]--;
			}
			func(now + 1, edg);
			for (int j = 0; j < edg[i].size(); j++) {
				in_degree[edg[i][j]]++;
			}
			mark[i] = 0;
		}
	}
}

int main() {
	cin >> n >> m;
	vector<vector<int> > edg(n + 1, vector<int>());
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		edg[a].push_back(b);
		in_degree[b]++;
	}
	func(1, edg);
	return 0;
}
*/

/*
7 8
1 2
3 2
3 4
3 5
2 5
4 6
5 7
6 7
*/