Cod sursa(job #2174961)

Utilizator PrEaDiVviNAlexandru Hutu PrEaDiVviN Data 16 martie 2018 14:29:52
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <bits/stdc++.h>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,viz[100001],nrc,c[100001],s;
vector <int> v[100001];

void bfs(int x)
{
    viz[x]=1;
    int in=1,sf=1;
    c[in]=x;
    while(in<=sf)
    {
        int y=c[in];
        for(int i=0;i<v[y].size();i++)
        {
            int vecin=v[y][i];
            if(!viz[vecin])
            {
                c[++sf]=vecin;
                viz[vecin]=viz[y]+1;
            }
        }
        in++;
    }
}

void citire()
{
    f>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        v[x].push_back(y);
    }
}
int main()
{
    citire();
    bfs(s);
    for(int i=1;i<=n;i++)
        cout<<viz[i]-1<<' ';
}