Cod sursa(job #696860)

Utilizator iuli1505Parasca Iuliana iuli1505 Data 28 februarie 2012 20:33:01
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include<cstdio>
#include<vector>
using namespace std;
#define max 50001
int n,m,x,y,i,viz[max],s[max],nr;
vector<int>a[max];
void dfs(int k)
{
	viz[k]=1;
	for(vector<int>::iterator it=a[k].begin();it!=a[k].end();it++)
		if(!viz[*it])
			dfs(*it);
	s[++nr]=k;
}
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);
		a[x].push_back(y);
	}
	for(i=1;i<=n;i++)
		if(!viz[i])
			dfs(i);
	for(i=nr;i>=1;i--)
		printf("%d ", s[i]);
	return 0;
}