Cod sursa(job #411401)

Utilizator andreea_92ungurean andreea andreea_92 Data 4 martie 2010 21:21:31
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include<stdio.h>
using namespace std;
int n,viz[50001],a[500][500],nr,postordine[50001]; 


void citire()
{

int x,y,m,i;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%d%d",&x,&y);
a[x][0]++; a[x][a[x][0]]=y;
}
}

void dfs(int x)
{
int i;
viz[x]=1;
for(i=1;i<=a[x][0];i++)
	if(!viz[a[x][i]])
		dfs(a[x][i]);
postordine[++nr]=x;
}

int main()
{
freopen("sortaret.in","r",stdin);	
freopen("sortaret.out","w",stdout);	
int i;
citire();
for(i=1;i<=n;i++)
	if(!viz[i])
		dfs(i);
printf("ord top a vf ");
for(i=n;i>0;i--)
	printf("%d",postordine[i]);
printf("\n");
return 0;
}