Cod sursa(job #1782045)

Utilizator gamanedyGaman Eduard-Marian gamanedy Data 17 octombrie 2016 18:58:30
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <fstream>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,viz[100002];
struct nod
{
    int v;
    nod *urm;
};
nod *L[100002], *p;
int coada[100002];
void fill_coada(int x)
{
    int pr,ul,i,y,z;
    nod *p;
    coada[1]=x;
    pr=1;
    ul=1;
    viz[x]=1;
    while(pr<=ul)
    {
        y=coada[pr];
        for(p=L[y];p!=0;p=p->urm)
        {
            z=p->v;
            if(viz[z]==-1)
            {
                viz[z]=1+viz[y];
                ul++;
                coada[ul]=z;
            }
        }
        pr++;
    }
}
int i,x,y,c,s;
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        p=new nod;
        p->v=y;
        p->urm=L[x];
        L[x]=p;
    }
    for(i=1;i<=n;i++)
    {
        viz[i]==-1;
    }
    fill_coada(s);
    for(i=1;i<=n;i++)
    {
        fout<<viz[i]<<" ";
    }
    return 0;
}