Cod sursa(job #2384862)

Utilizator qusyNastase Alexandru qusy Data 21 martie 2019 11:29:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <iostream>
#include <queue>
#include <fstream>
#include <vector>

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

queue <int> myq;
vector <int> graph[100001];
int viz[100001];
int dist[100001];
void BFS(int source)
{
    dist[source]=0;
    myq.push(source);
    viz[source]=1;
    while(!myq.empty())
    {
        int x=myq.front();
        myq.pop();
        cout<<x<<' ';
        for(int i=0; i<(int)graph[x].size(); i++)
        {
            int vecin=graph[x][i];
            if(!viz[vecin])
            {
                dist[vecin]=dist[x]+1;
                viz[vecin]=1;
                myq.push(vecin);
            }
        }
    }
}
int main()
{
    int N,M,s,x,y;
    fin>>N>>M>>s;
    for(int i=0; i<M; i++)
    {
        fin>>x>>y;
        graph[x].push_back(y);
    }

    BFS(s);
    for(int i=1;i<=N;i++)
        if(viz[i]==0)
        fout<<-1<<' ';
    else
        fout<<dist[i]<<' ';
    return 0;
}