You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
69 lines
644 B
69 lines
644 B
int map[10][10];
|
|
int indegree[10];
|
|
int queue[10];
|
|
void topo(int n)
|
|
{
|
|
int m=0;
|
|
int t=0;
|
|
int i,j;
|
|
i=1;
|
|
j=1;
|
|
while(i<=n)
|
|
{
|
|
j=1;
|
|
while(j<=n)
|
|
{
|
|
if(indegree[j]==0)
|
|
{
|
|
|
|
m=j;
|
|
break;
|
|
}
|
|
j=j+1;
|
|
}
|
|
queue[t]=m;
|
|
t=t+1;
|
|
indegree[m]=-1;
|
|
j=1;
|
|
while(j<=n)
|
|
|
|
{
|
|
if(map[m][j])
|
|
{
|
|
indegree[j]=indegree[j]-1;
|
|
}
|
|
j=j+1;
|
|
}
|
|
i=i+1;
|
|
}
|
|
i=0;
|
|
while(i<n)
|
|
{
|
|
putint(queue[i]);
|
|
putch(10);
|
|
i=i+1;
|
|
}
|
|
|
|
}
|
|
int main()
|
|
{
|
|
int n,p;
|
|
int i=1;
|
|
n=5;
|
|
|
|
while(i<=n)
|
|
{
|
|
p=getint();
|
|
while(p!=0)
|
|
{
|
|
map[i][p]=1;
|
|
indegree[p]=indegree[p]+1;
|
|
p=getint();
|
|
|
|
}
|
|
i=i+1;
|
|
}
|
|
topo(n);
|
|
return 0;
|
|
}
|