poj2367 拓扑序

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<queue>
 4 using namespace std;
 5 
 6 int ma[105][105],id[105],n;
 7 
 8 void topo(){
 9     queue<int>q;
10     for(int i=1;i<=n;++i)if(!id[i])q.push(i);
11     int cnt=0;
12     while(!q.empty()){
13         int u=q.front();
14         q.pop();
15         printf("%d",u);
16         if(++cnt==n)printf("\n");
17         else printf(" ");
18         for(int i=1;i<=n;++i){
19             if(i!=u&&ma[u][i]){
20                 id[i]--;
21                 if(!id[i])q.push(i);
22             }
23         }
24     }
25 }
26 
27 int main(){
28     scanf("%d",&n);
29     for(int i=1;i<=n;++i){
30         int a;
31         while(scanf("%d",&a)&&a){
32             ma[i][a]=1;
33             id[a]++;
34         }
35     }
36     topo();
37     return 0;
38 }