题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=1285
题解:
拓扑排序
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int inDeep[550],n,m;
int topo[550],t,G[500][500];
void toposort()
{
int i = 1;
while(i <= n)
{
for(int j = 1; j <= n; j++)
{
if(inDeep[j] == 0)
{
inDeep[j]--;
topo[i++] = j;
for(int k = 1; k <= n; k++)
{
if(G[j][k])
{
inDeep[k]--;
}
}
break;//一定要break,找到一个点后马上重新找
}
}
}
}
int main()
{
while(cin >> n >> m)
{
memset(inDeep, 0 , sizeof(inDeep));
memset(G, 0 , sizeof(G));
memset(topo, 0 , sizeof(topo));
while(m--)
{
int a, b;
cin >> a >> b;
if(G[a][b] == 0)
{
G[a][b] = 1;
inDeep[b]++;
}
}
toposort();
for(int i = 1; i < n; i++)
cout << topo[i] <<" ";
cout << topo[n] << endl;
}
return 0;
}