Pagini recente » Cod sursa (job #892499) | Cod sursa (job #827015) | Cod sursa (job #268413) | Cod sursa (job #953099) | Cod sursa (job #1064984)
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
vector<int> v[100003];
vector<int>::iterator it;
queue<int>q;
int d[100003];
int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
int n,m,s,i,x,y,u;
scanf("%d%d%d",&n,&m,&s);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
v[x].push_back(y);
}
for(i=1;i<=n;i++)
d[i]=-1;
q.push(s);
d[s]=0;
while(!q.empty())
{
u=q.front();
for(it=v[u].begin();it!=v[u].end();it++)
if(d[*it]==-1)
{
d[*it]=d[u]+1;
q.push(*it);
}
q.pop();
}
for(i=1;i<=n;i++)
printf("%d ",d[i]);
printf("\n");
return 0;
}