Cod sursa(job #1455930)

Utilizator Liviu98Dinca Liviu Liviu98 Data 29 iunie 2015 14:47:09
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <vector>
#include <stdio.h>
#include <stack>
#define NMax 50005
using namespace std;
int N,M;
vector <int> Graf[NMax];
stack <int> Stiva;
bool viz[NMax];

void Citire()
{
    freopen("sortaret.in","r",stdin);
    int x,y;
    scanf("%d %d ",&N,&M);
    for(int i=0;i<M;i++)
    {
        scanf("%d%d",&x,&y);
        Graf[x].push_back(y);
    }
}

void DFS(int index){
    int j;
    viz[index] = 1;
    for (j=0; j<Graf[index].size(); j++)
        if (viz[Graf[index][j]] == 0)
            DFS(Graf[index][j]);

    viz[index] = 2;
    Stiva.push(index);

}

void Write()
{
     freopen("sortaret.out","w",stdout);
     for(int i=1;i<=N;i++)
        if(viz[i]==0)
        DFS(i);

     while(!Stiva.empty())
     {
         printf("%d ",Stiva.top());
         Stiva.pop();
     }
}

int main()
{
    Citire();
    Write();
}