拓扑排序（模版

添加链接描述拓扑排序不在乎自环和重复边因为自环不会入队列重复边会早晚入队列每次把入边都减1减为0的加入拓扑排序队列并且更新答案#includebits/stdc.h#includeiostreamusingnamespacestd;constintN1e59;vectorintv[N];intine[N]{};intn,m;vectorintans;voidbfs(){queueintq;for(inti1;in;i){if(ine[i]0){q.push(i);ans.push_back(i);}}while(q.size()){intxq.front();q.pop();for(autoit:v[x]){ine[it]--;if(ine[it]0){q.push(it);ans.push_back(it);}}}}intmain(){cinnm;for(inti0;im;i){intindexA,indexB;scanf(%d %d,indexA,indexB);v[indexA].push_back(indexB);ine[indexB];}bfs();if(ans.size()!n){cout-1;return0;}for(autoit:ans){printf(%d ,it);}return0;}