Cod sursa(job #2058273)

Utilizator papinub2Papa Valentin papinub2 Data 5 noiembrie 2017 13:45:51
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>
#include <vector>

using namespace std;

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

int n, m, x, y, nr;
int viz[50010], postordine[50010];
vector <int> A[50010];

void DFS (int P)
{
    viz[P] = 1;

    for (int i = 0; i < A[P].size(); i++)
        if (!viz[A[P][i]])
            DFS(A[P][i]);
    postordine[++nr] = P;
}

int main()
{
    in >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        A[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        if (!viz[i])
            DFS(i);

    for (int i = n; i >= 1; i--)
        out << postordine[i] << ' ';

    return 0;
}