Cod sursa(job #408186)
Utilizator | Vladutz Vladberila | Data | 2 martie 2010 21:28:18 |
---|---|---|---|
Problema | Sortare topologica | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream.h>
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,i,a[1001][1001],postordine[5001],viz[5001],nr;
void DFS(int x)
{
int i;
viz[x]=1;
for(i=1;i<=n;i++)
if(!viz[i] && a[x][i]==1)
DFS(i);
postordine[++nr]=x;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
f.close();
for(i=1;i<=n;i++)
if(!viz[i])
DFS(i);
for(i=n;i>=1;i--)
g<<postordine[i]<<' ';
g<<'\n';
g.close();
return 0;
}