Cod sursa(job #1163309)

Utilizator chiriacandrei25Chiriac Andrei chiriacandrei25 Data 1 aprilie 2014 12:04:46
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <cstdio>
#include <vector>
#define Nmax 50005

using namespace std;

int N;
vector <int> L[Nmax];
bool viz[Nmax],fr[Nmax];

inline void Dfs(int nod)
{
    int len=L[nod].size(),i;
    viz[nod]=true;
    printf("%d ", nod);
    for(i=0;i<len;++i)
        if(!viz[L[nod][i]])
            Dfs(L[nod][i]);
}

int main()
{
    int M,x,y,tata;
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);
    scanf("%d%d", &N,&M);
    while(M--)
    {
        scanf("%d%d", &x,&y);
        L[x].push_back(y);
        fr[y]=true;
    }
    for(tata=1;fr[tata];++tata);
    Dfs(tata);
    printf("\n");
    return 0;
}