Cod sursa(job #933549)

Utilizator VladMSBonta vlad valentin VladMS Data 30 martie 2013 08:59:22
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <fstream>
#include <list>
#include <vector>
#define NMAX 100
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int i,j,n,m,x,y,viz[NMAX],rez[NMAX],gr[NMAX],w;
list<int> q;
vector<int> v[NMAX];
vector<int>::iterator it;
int main()
{
    fin>>n>>m;
    for(;m;m--)
    {
        fin>>x>>y;
        v[x].push_back(y);
        gr[y]++;
        viz[y]++;
    }
    for(i=1;i<=n;++i)
    {
        if(viz[i]==0)
            q.push_back(i);
        viz[i]=0;
    }
    while(!q.empty())
    {
        x=q.front();
        q.pop_front();
        rez[++w]=x;
        viz[x]=1;
        for(it=v[x].begin();it!=v[x].end();++it)
            {
                if(viz[*it]==0&&gr[*it]-1==0)
                    {
                        q.push_back(*it);
                        viz[*it]=1;
                        gr[*it]--;
                    }
            }
    }
    for(i=1;i<=n;++i)
        fout<<rez[i]<<" ";
    return 0;
}