Cod sursa(job #295231)

Utilizator spidyvenomMarius Toma spidyvenom Data 3 aprilie 2009 09:08:43
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<fstream.h>
#define nmax 100010
int s,n,i,v[nmax],cd[nmax],lg[nmax];
long m;
ifstream f("bfs.in");
ofstream g("bfs.out");

struct nod
    {int z;
    nod *adr;};
nod *l[nmax];

void citire()
{
nod *c;
int i,j;
while (f>>i>>j)
    {
    c=new nod;
    c->z=j;
    c->adr=l[i];
    l[i]=c;
    }
}

void bfs(int x)
{
nod *c;
int z,p,u;
for (int i=1;i<=n;i++) lg[i]=-1;
//memset(lg,-1,sizeof(lg));
lg[x]=0;
p=u=1;
v[x]=1;
cd[p]=x;
for (;p<=u;p++)
    {
    z=cd[p];
    for (c=l[z];c!=NULL;c=c->adr)
	if (!v[c->z])
	    {
	    cd[++u]=c->z;
	    v[cd[u]]=1;
	    lg[c->z]=lg[z]+1;
	    }
    }
}


int main()
{
f>>n>>m>>s;
citire();
bfs(s);
for (i=1;i<=n;i++) g<<lg[i]<<" ";
g.close();
return 0;
}