Cod sursa(job #1703669)

Utilizator NastureNasture Anca Nasture Data 17 mai 2016 13:39:28
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include<cstdio>
#include<vector>
using namespace std;
vector <int> st,lista[1001];
vector <int>::iterator it;
int n,viz[1001];

void citire(){
    int m,n1,n2;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d%d",&n1,&n2);
        lista[n1].push_back(n2);
    }
}


void sorttop(int nod){
viz[nod]=1;
for(int i=0;i<lista[nod].size();i++)
    if(viz[lista[nod][i]]==0)
        sorttop(lista[nod][i]);
st.push_back(nod);
}

void afisare(){
    for(int i=st.size()-1;i>=0;i--)
        printf("%d ",st[i]);
}
int main(){
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    sorttop(1);
    afisare();
    return 0;
}