Cod sursa(job #904140)

Utilizator hoffen42FMI Ana hoffen42 Data 3 martie 2013 19:37:52
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include <iostream>
#include <fstream>

using namespace std;

#define ALB 0
#define GRI 1
#define NEGRU 2
#define NMAX 50005

typedef struct nod
{
    int vf;
    nod *next;
} *PNOD, NOD;

PNOD L[NMAX], sol;
int N,M, x, y, color[NMAX];

ifstream in("sortaret.in");
ofstream out("sortaret.out");

void adauga (int a, int b)
{
    PNOD p = new NOD;
    p->vf = b;
    p->next = L[a];
    L[a] = p;
}

void citire ()
{
   in>>N>>M;

    for(int i = 1; i <= M; i++)
    {
        in>>x>>y;
        adauga(x, y);
    }
}

void push (int i)
{
    PNOD p = new NOD;
    p->vf = i;
    p->next = sol;
    sol = p;
}

void DF (int i)
{
    color[i] = GRI;
    for( PNOD p = L[i]; p; p = p->next)
        if(color[p->vf] == ALB)
            DF (p->vf);
    color[i] = NEGRU;
    push (i);
}

void sortareT ()
{
    for(int i = 1; i <= N; i++)
    {
        if(color[i] == ALB)
            DF (i);
    }
}

void afisare ()
{
    for(PNOD p = sol; p; p = p->next)
        out<<p->vf<<" ";
}

int main()
{
    citire();
    sortareT();
    afisare();

    return 0;
}