Cod sursa(job #355439)

Utilizator borsoszalanBorsos Zalan borsoszalan Data 11 octombrie 2009 10:04:48
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<stdio.h>
#define nmax 50001
#define mmax 2000

int n,m,i,x,y,nr;
int ad[nmax][mmax], viz[nmax], post[nmax];

void read()
{
	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);
		ad[x][++ad[x][0]]=y;
	}

}

void dfs(int x)
{
	int j;
	viz[x]=0;
	for(j=1;j<=ad[x][0];j++)
		if(!viz[ad[x][j]])
			dfs(ad[x][j]);
	post[++nr]=x;
}

int main()
{
	read();
	for(i=1;i<=n;i++)
		if(!viz[i])
			dfs(i);
	for(i=n;i>=1;i--)
		printf("%d ", post[i]);
	printf("\n");
	return 0;
}