Cod sursa(job #2267167)

Utilizator TeoMiliMilitaru Teodora TeoMili Data 23 octombrie 2018 13:14:53
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
#include<vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector <int> v[1001];
int i,n,m,s,viz[100001],q[100001],x,y;
void coada(int x){
    int k,p,u,i;
    p=u=1;
    q[p]=x;
    while(p<=u){
        k=q[p];
        p++;
        for(i=0;i<v[k].size();i++)
            if(viz[v[k][i]]==0){
                u++;
                q[u]=v[k][i];
                viz[v[k][i]]=viz[k]+1;
            }
    }
}
int main()
{
    cin>>n>>m>>s;
    for(i=1;i<=m;i++){
        cin>>x>>y;
        v[x].push_back(y);
       // v[y].push_back(x);
    }
    viz[s]=1;
    coada(s);
    for(i=1;i<=n;i++)
        cout<<viz[i]-1<<" ";
    return 0;
}