Cod sursa(job #1605635)

Utilizator andrey-jkOtopeleanu Andrei Cristian andrey-jk Data 19 februarie 2016 12:01:52
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
using namespace std;
int n,m,i,viz[100001],X,x,y;
vector <int > v[100001];
ifstream f("bfs.in");
ofstream g("bfs.out");
void BF(int x)
{
    vector <int > :: iterator it;
    int C[100001],p,u,k;
    C[1]=x;p=u=1;viz[x]=1;
    while(p<=u)
    {
        k=C[p];
        for(it=v[k].begin();it!=v[k].end();it++)
        if(viz[*it]==0)
        {
            C[++u]=*it;
            viz[*it]=viz[k]+1;
        }
        p++;
    }

}
int main()
{
    f>>n>>m>>X;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        //v[y].push_back(x);
    }
    BF(X);
    for(i=1;i<=n;i++)
    g<<viz[i]-1<<" ";
    return 0;
}