//基于AOV(activity on vertex)網絡的拓撲排序
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
#define VN 20
vector<int> p[VN];
int de[VN];
int main()
{
int i,j,s,e;
int n;
int re[VN];
memset(de,0,sizeof(de));
freopen("in.txt","r",stdin);
scanf("%d",&n);
while(scanf("%d%d",&s,&e))
{
if(s==0&&e==0) break;
p[s].push_back(e);
de[e]++;
}
int k=0;
int flag;
for(i=1;i<=n;i++)
{
flag=0;
for(j=1;j<=n;j++)
if(de[j]==0)
{
re[k++]=j;
int len=p[j].size();
for(int t=0;t<len;t++)
de[p[j][t]]--;
de[j]=-1;
flag=1;
break;
}
if(!flag) break;
}
if(k<n) printf("Can't do it\n");
else
{
for(i=0;i<n;i++)
printf("%d ",re[i]);
printf("\n");
}
return 0;
}
測試結果：
8
2 1
3 2
2 4
5 4
7 8
1 8
8 3
3 6
4 8
4 6
0 0
Can't do it
8
2 1
2 3
2 4
5 4
7 8
1 8
3 8
3 6
4 8
4 6
0 0
2 1 3 5 4 6 7 8