Cod sursa(job #1026424)

Utilizator caliuxSegarceanu Calin caliux Data 11 noiembrie 2013 16:53:36
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <stdio.h>
#include <vector>
#define NMAX 50005
using namespace std;

int N, M;

vector <int> vf[NMAX];
int rez[NMAX];
bool vizitat[NMAX];


void DFS(int x){
    printf("%d ", x);
    vizitat[x] = 1;
    for(int i = 0; i < vf[x].size(); i++){
        if(vizitat[vf[x][i]] == 0){
            DFS(vf[x][i]);
        }
    }
    //rez[++rez[0]] = x;
}

int main(){

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

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

    for(i = 1; i <= N; i++){
        if(!vizitat[i]){
            DFS(i);
        }
    }
    for(i = rez[0]; i > 0; i--){
       // printf("%d ", rez[i]);
    }
}