Pagini recente » Cod sursa (job #3175285) | Cod sursa (job #2720449) | Cod sursa (job #1367285) | Cod sursa (job #805019) | Cod sursa (job #1759206)
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int N,M,S;
int a[100001];
int *graf[100001];
int dim[100001];
void bfs()
{
int q[200001],inc=0,sf=-1;
memset(a,-1,sizeof(a));
q[++sf]=S;
a[S]=0;
while(inc<=sf)
{
int nod=q[inc++];
for(int i=0;i<dim[nod];i++)
{
if(a[graf[nod][i]]>a[nod]+1 || a[graf[nod][i]]==-1)
{
a[graf[nod][i]]=a[nod]+1;
q[++sf]=graf[nod][i];
}
}
}
for(int i=1;i<=N;i++)
printf("%d ",a[i]);
}
void adauga_vecin(int from,int to)
{
graf[from]=realloc(graf[from],(++dim[from])*sizeof(int));
graf[from][dim[from]-1]=to;
}
int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d %d %d",&N,&M,&S);
for(int i=1;i<=M;i++)
{
int from,to;
scanf("%d %d",&from,&to);
adauga_vecin(from,to);
}
bfs();
return 0;
}