Cod sursa(job #1487636)

Utilizator sorynsooSorin Soo sorynsoo Data 17 septembrie 2015 10:21:45
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,x,y,i,j;
vector<int> graf[50001],rasp;
bool fol[50001];
void bfs(int nod)
{
    for(int i=0; i<graf[nod].size(); i++)
    {
        if(!fol[graf[nod][i]])
        {
            rasp.push_back(graf[nod][i]);
            fol[graf[nod][i]]=true;
            bfs(graf[nod][i]);
        }
    }
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
    }
    for(i=1; i<=n; i++)
    {
        if(!fol[i])
        {
            rasp.push_back(i);
            fol[i]=true;
            bfs(i);
        }
    }
    for(int i=0; i<rasp.size(); i++)
        cout<<rasp[i]<<" ";
}