Pagini recente » Cod sursa (job #174337) | Cod sursa (job #979250) | Cod sursa (job #847135) | Cod sursa (job #2228119) | Cod sursa (job #1563317)
#include <list>
#include <cstdio>
#include <queue>
using namespace std;
int viz[100000];
int main()
{freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
int n,m,i,p,u,x,a,b;
scanf("%d%d%d",&n,&m,&x);
queue<int>coada;
list <int>v[100001];
list<int>::const_iterator s,j;
int w[100000];
for(i=1;i<=n;i++)viz[i]=w[i]=-1;w[x]=0;viz[x]=0;
for(i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
v[a].push_back(b);
}
coada.push(x);b=0;
while(!coada.empty())
{
a=coada.front();
coada.pop();
for(s=v[a].begin(),j=v[a].end();s!=j;s++)
{ if(viz[*s]<0){viz[*s]=viz[a]+1;w[*s]=viz[*s];coada.push(*s);}
}
}
for(i=1;i<=n;i++)
printf("%d ",w[i] );
return 0;
}