Cod sursa(job #305995)

Utilizator utcistuBarcau Tomsa utcistu Data 19 aprilie 2009 12:17:05
Problema Sortare topologica Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.88 kb
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define VMAX 50010
#define EMAX 100010

int start[EMAX],target[EMAX],prev[EMAX],last[VMAX],list[VMAX];
char viz[VMAX];
int edgeNo,nodeNo,push;

void dfs(int node)
{
    int i;
    for (i=last[node];i>=0;i=prev[i])
    if (!viz[target[i]])
    {
        viz[target[i]]=1;
        dfs(target[i]);
    }
    list[push--]=node+1;
}

int main()
{
    int i,x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&nodeNo,&edgeNo);
    for (i=0;i<nodeNo;i++) last[i]=-1;
    for (i=0;i<edgeNo;i++)
    {
        scanf("%d %d",&x,&y);x--;y--;
        start[i]=x;target[i]=y;prev[i]=last[x];last[x]=i;
    }
    push=nodeNo-1;
    for (i=0;i<nodeNo;i++)
    if (!viz[i]) dfs(i);
    for (i=0;i<nodeNo;i++) printf("%d ",list[i]);
    fclose(stdout);
    return 0;
}