Cod sursa(job #165702)

Utilizator anamaria1Ozorchevici Ana Maria anamaria1 Data 26 martie 2008 16:52:44
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<fstream.h>
#define max 50001
struct graf
 {unsigned int nod;
  graf *urm;
 };
graf *g[max];
char viz[max];
long a[max],cont;
void adauga(long x,long y)
{graf *p;
p=new graf;
p->nod=y;
p->urm=g[x];
g[x]=p;
}
void dfs(long x)
{graf *p=g[x];
viz[x]=1;
while(p) {if(!viz[i]) dfs(p->nod);p=p->urm;}
a[++cont]=x;
}
int main()
{ifstream f("sortaret.in");
ofstream h("sortaret.out");
long n,m,x,y,i;
f>>n>>m;
for(i=1;i<=m;i++)
 {f>>x>>y;adauga(x,y);}
f.close();
for(i=1;i<=n;i++)
 if(!viz[i]) dfs(i);
for(i=n;i>=1;i--) h<<a[i]<<' ';
h<<'\n';
h.close();
return 0;
}