Cod sursa(job #2420465)

Utilizator lionking2000lionking2000 lionking2000 Data 12 mai 2019 11:22:36
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
#include<iostream>
using namespace std;
int n,m,s,a,b,v[1003][1003],coada[1003],st,dr,sol[1003],nod;
int main()
{
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        v[a][b]=1;
    }
    coada[1]=s;
    st=1; dr=1;
    for(int i=1;i<=n;i++)
        sol[i]=-1;
    sol[s]=0;
    while(st<=dr)
    {
        nod=coada[st];
        ++st;
        for(int i=1;i<=n;++i)
        {
            if(!v[nod][i]) continue;
            if(sol[i]!=-1) continue;
            ++dr;
            coada[dr]=i;
            sol[i]=sol[nod]+1;
        }
    }
    for(int i=1;i<=n;++i)
        cout<<sol[i]<<' ';
    return 0;
}