kahn代码存档

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
vector<int> e[100],tp;
int din[100],m,n,a,b;
bool toposort(){
	queue<int> q;
	for(int i=1;i<=n;i++){
		if(din[i]==0)q.push(i);
	}
	while(q.size()){
		int x=q.front();
		q.pop();
		tp.push_back(x);
		for(auto y:e[x]){
			if(--din[y]==0){
				q.push(y);
			}
		}
	}
	return tp.size()==n;
}
int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>a>>b;
		e[a].push_back(b);
		din[b]++;
	}
	if(!toposort())printf("-1");
	else for(int i=0;i<tp.size();i++)printf("%d",tp[i]);
	return 0;
}