Cod sursa(job #1564646)

Utilizator TopiAlexTopala Alexandru TopiAlex Data 9 ianuarie 2016 20:26:43
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <stdio.h>
#include <vector>
#define N_MAX 50003
using namespace std;

int n, m;
bool viz[N_MAX];
vector <int> lists[N_MAX];
int postordine[N_MAX];
int ind;

void citire();
void DFS(int);
void afisare();

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

    afisare();

    return 0;
}

void citire(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d%d", &n, &m);

    int x, y;
    for (int i = 1; i <= m; ++i){
        scanf("%d%d", &x, &y);
        lists[x].push_back(y);
    }
}

void DFS(int k){
    int v_size = lists[k].size();
    for (int i = 0; i < v_size; ++i){
        if (!viz[lists[k][i]]){
            viz[lists[k][i]] = true;
            DFS(lists[k][i]);
        }
    }
    postordine[++ind] = k;
}

void afisare(){
    for (int i = n; i > 0; --i){
        printf("%d ", postordine[i]);
    }
    printf("\n");
}