7-34 任务调度的合理性 (25 分)

拓扑排序

#include 
#include 
#include 
#include 
#include 
using namespace std;
const int N = 105;
int ind[N] = {0};
int n;
vector<int> G[N];
bool topsort(){
	int cnt = 0;
	queue<int> q;
	for(int i = 1; i <= n; i++){
		if(!ind[i]) q.push(i);
	}
	while(q.size()){
		int t = q.front();
		q.pop();
		cnt++;
		for(int j = 0; j < G[t].size(); j++){
			int v = G[t][j];
			ind[v]--;
			if(!ind[v]) q.push(v);
		} 
	}
	if(cnt == n) return 1;
	else return 0;
}
int main(){
	int x, k;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%d", &k);
		ind[i] = k;
		while(k--){
			scanf("%d", &x);
			G[x].push_back(i); //这里别写错了 应该是子依赖指向当前顶点 
		}
	}
	if(topsort()) puts("1");
	else puts("0");
	return 0;
}