Cod sursa(job #1328738)

Utilizator frantiu.andreiFrantiu Andrei Mihai frantiu.andrei Data 28 ianuarie 2015 18:36:13
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <fstream>
#include <vector>
#define NMax 50005

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int> G[NMax],Sol;
int N,M,Use[NMax];

void Read()
{
    int x,y;
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
}

void DFS(int Nod)
{
    Use[Nod]=1;
    for(unsigned int i=0;i<G[Nod].size();i++)
    {
        int Vecin=G[Nod][i];
        if(!Use[Vecin])
        {
            DFS(Vecin);
            Sol.push_back(Vecin);
        }
    }
}

void Print()
{
    for(int i=Sol.size()-1;i>=0;i--)
        g<<Sol[i]<<" ";
}

int main()
{
    Read();
    DFS(1);
    Sol.push_back(1);
    Print();
    return 0;
}