Cod sursa(job #388988)

Utilizator DaicuDaicu Alexandru Daicu Data 31 ianuarie 2010 16:21:56
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<stdio.h>
#include<stdlib.h>
#define max 50002
int *a[max];
int pord[max],n,nr,viz[max];
unsigned int m;
void citire()
{scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{a[i]=(int *)realloc(a[i],sizeof(int));
a[i][0]=0;
}
int x,y;
for(unsigned int i=1;i<=m;i++)
{scanf("%d%d",&x,&y);
a[x][0]++;
a[x]=(int *)realloc(a[x],(a[x][0]+1)*sizeof(int));
a[x][a[x][0]]=y;
}
}
void dfs(int x)
{viz[x]=1;
pord[++nr]=x;
for(int i=1;i<=a[x][0];i++)
	if(!viz[a[x][i]])
		dfs(a[x][i]);
}
int main()
{freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
citire();
for(int i=1;i<=n;i++)
	if(!viz[i])
		dfs(i);
for(int i=1;i<=n;i++)
	printf("%d ",pord[i]);
return 0;
}