例题6-15(uva-10305)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>

#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int MSIZE = 105;
int du[MSIZE],vis[MSIZE],n,m;
vector<int> g[105], result;

int main()
{
	int a, b,cnt;
	while (cin >> n >> m && n) {
		memset(du, 0, sizeof(du));
		memset(vis, 0, sizeof(vis));
		for (int i = 0; i < MSIZE; ++i) g[i].clear();
		result.clear();
		
		for (int i = 0; i < m; ++i) {
			cin >> a >> b;
			//a -> b
			g[a].emplace_back(b);
			//b 的入度 + 1
			du[b]++;
		}

		cnt = n;
		queue<int> zero;
		bool isok = true;
		while (cnt || !isok) {
			//查找剩下未访问的点  入度是否为0
			for (int i = 1; i <= n; ++i) {
				if (vis[i]) continue;
				if (du[i] == 0) {
					zero.push(i);
					vis[i] = 1;
				}
			}
			//找不到入度为0的点
			if (zero.empty()) { isok = false; continue; }

			while (isok && !zero.empty()) {
				int t = zero.front(); zero.pop(); cnt--;
				//记录点 作为路径输出
				result.emplace_back(t);
				//取出当前入度为0的点 所有关联边 入度-1
				for (int i = 0; i < g[t].size(); ++i) {
					//有环
					if (--du[g[t][i]] < 0) {
						isok = false;
						break;
					}
				}
			}
		}
		if (isok) {
			for (int i = 0; i < result.size(); ++i) {
				if (i) cout << " ";
				cout << result[i];
			}
			cout << endl;	
		}
	}
	return 0;
}