Cod sursa(job #1917050)

Utilizator radiogard1999Dragoi Andrei radiogard1999 Data 9 martie 2017 11:01:17
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <bits/stdc++.h>
#define Nmax 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int st[Nmax],n,m,viz[Nmax],k;
vector <int> L[Nmax];
void Citire()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    fin.close();
}
inline void DFS(int nod)
{
    int i;
    viz[nod]=1;
    for(i=0;i<L[nod].size();i++)
        if(!viz[L[nod][i]]) DFS(L[nod][i]);
    st[++k]=nod;
}
int main()
{
    Citire();
    DFS(1);
    while(k)
    {
        fout<<st[k]<<"\n";
        k--;
    }
    fout.close();
    return 0;
}