Cod sursa(job #907650)
| Utilizator | Data | 8 martie 2013 10:13:53 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<cstdio>
#include<vector>
using namespace std;
vector<int>v[50005];
int x,y,n,i,j,k,m;
bool viz[50005];
void df(int x)
{
viz[x]=true;
printf("%d ",x);
for (j=0;j<v[x].size();j++) if (!viz[v[x][j]]) df(v[x][j]);
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++) scanf("%d %d",&x,&y),v[x].push_back(y);
for(i=1;i<=n;i++) if (!viz[i]) df(i);
return 0;
}
