Cod sursa(job #1880185)

Utilizator robertispasIspas Robert robertispas Data 15 februarie 2017 16:41:19
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>
#include <vector>

using namespace std;

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

const int N = 100005;
vector<int> a[N];
int n, m, nr, stop[N];
bool viz[N];

void citire()
{
    int i, x, y;
    in>>n>>m;
    for(i = 1; i <= m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    in.close();
}

void dfs(int x)
{
    int i, y;
    viz[x] = true;
    for(i = 0; i < a[x].size(); i++)
    {
        y = a[x][i];
        if(!viz[y]) dfs(y);
    }
    stop[++nr] = x;
}

int main()
{
    int i;
    citire();
    for (int i=1;i<=n;i++)
        if (!viz[i])
        {
            dfs(i);
            nr++;
        }
    for(i = nr-1; i >= 1; i--)
        out<<stop[i]<<" ";
    return 0;
}