Cod sursa(job #2662466)

Utilizator kerry6205Motiu Radu kerry6205 Data 24 octombrie 2020 10:11:30
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
#include <vector>
#define O 50005
using namespace std;

vector<vector<int> > G;
bool viz[O];
int TS[O];
int N, M, k;

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

void citire()
{
    in >> N >> M;
    G.resize(N + 2);
    int x, y;
    for(int i = 1; i <= M; i++)
    {
        in >> x >> y;
        G[x].push_back(y);
//        G[y].push_back(x);
    }
}

void DFS(int z)
{
    viz[z] = 1;
    for(int i = 0; i < G[z].size(); i++)
    {
        int Vecin = G[z][i];
        if(!viz[Vecin])
            DFS(Vecin);
    }
    TS[++k] = z;
}

int main()
{
    citire();
    for(int i = 1; i <= N; i++)
        if(!viz[i])
            DFS(i);
    DFS(1);
    for(int i = N; i >= 1; i--)
        out << TS[i] << ' ';
}