Cod sursa(job #1514881)

Utilizator NacuCristianCristian Nacu NacuCristian Data 31 octombrie 2015 19:25:41
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <stdio.h>
#include <stack>
#include <vector>

using namespace std;

int n,m;
stack <int> q;
vector <int> g[100020];

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
        int a,b;
        scanf("%d %d",&a,&b);
        g[a].push_back(b);
    }
}

int viz[100020];

void dfs(int k)
{
    for(int i=0;i<g[k].size();i++)
        if(!viz[g[k][i]])
    {
        viz[g[k][i]]=1;
        dfs(g[k][i]);
    }
    q.push(k);

}

void afisare()
{
    freopen("sortaret.out","w",stdout);
    while(!q.empty())
    {
        printf("%d ",q.top());
        q.pop();
    }
}

int main()
{
    citire();
    dfs(1);
    afisare();
    return 0;
}