Cod sursa(job #1411091)

Utilizator karlaKarla Maria karla Data 31 martie 2015 14:00:16
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <stdio.h>
#include <vector>

using namespace std;

int n, m, viz[50010], sol[50010], k, fol[50010];
vector<int> l[100010];
FILE*f=fopen("sortaret.in","r"),*g=fopen("sortaret.out","w");


void DFS(int nod)
{
    viz[nod] = 1;
    sol[++k] = nod;
    for(int i = 0; i < l[nod].size();i++)
    {
        if(viz[l[nod][i]] == 0)
        {
            DFS(l[nod][i]);
        }
    }
}

void afisare()
{
    for(int i = 1;i <= n; i++)
    {
        fprintf(g,"%d ",sol[i]);
    }
}

int main()
{
    int x, y;
    fscanf(f,"%d %d\n",&n,&m);
    for(int i = 1; i <= m; i++)
    {
        fscanf(f,"%d %d\n",&x,&y);
        l[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0 && l[i].size() != 0)
        {
             DFS(i);
             sol[++k] = i;
        }
    }
    afisare();
    return 0;
}