Cod sursa(job #1109833)

Utilizator bia423Bianca Floriana bia423 Data 17 februarie 2014 17:22:29
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
# define nmax 50005
# define mmax 100005
vector<int>graf[nmax];
int n,m,coada[nmax],grd[nmax],ps=1,r,viz[nmax];
void dfs(int nod)
{ int i;
 for(i=0;i<graf[nod].size();i++)
                 {viz[graf[nod][i]]=1;grd[graf[nod][i]]--;
if(grd[graf[nod][i]]==0){coada[r]=graf[nod][i]; r++; dfs(graf[nod][i]);}
                 }
}


int main()
{ int i,a,b,j;
    in>>n>>m;
    for(i=1;i<=m;i++)
    { in>>a>>b;
        graf[a].push_back(b);
        grd[b]++;
    }
    for(i=1;i<=n;i++)
        if(grd[i]==0&&viz[i]==0){coada[r]=i;r++;   dfs(i); }


for(i=0;i<r;i++)
    out<<coada[i]<<" ";
 /*for(j=1;j<=n;j++)
    {
     cout<<j<<" ";
    for(i=0;i<graf[j].size();i++)
        cout<<graf[j][i]<<" ";
        cout<<"\n"; } */


    return 0;
}