Cod sursa(job #2418189)

Utilizator alexnigaNiga Alexandru alexniga Data 4 mai 2019 03:25:26
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
#include <vector>
#define MAX 50002
using namespace std;

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

int n, m, postordine[50002], nr;
vector <vector<int>> G(MAX);
vector <int> viz(50002, 0);
void DFS(int start)
{   int i;
    viz[start] = 1;
    for (auto i : G[start])
    {
        if (viz[i] == 0)
            DFS(i);
    }
    postordine[++nr] = start;

}

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

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;

        G[x].push_back(y);

    }
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            {DFS(i);}//cout << i;}
    for (int i = n; i > 0; i--)
        g << postordine[i] << " ";

    return 0;
}