Pagini recente » Cod sursa (job #755468) | Cod sursa (job #1952331) | Cod sursa (job #2141591) | Cod sursa (job #1200748) | Cod sursa (job #2022587)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int>v[100005];
bool viz[100005];
int d[100005],n,m,nod,a,b;
queue<int>q;
int main()
{
ios_base::sync_with_stdio();
cin>>n>>m>>nod;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
v[a].push_back(b);
}
q.push(nod);
viz[nod]=1;
while(!q.empty())
{
int x=q.front();
q.pop();
for(int i=0;i<v[x].size();x++)
if(!viz[v[x][i]])
{
viz[v[x][i]]=1;
d[v[x][i]]=d[x]+1;
q.push(v[x][i]);
}
}
for(int i=1;i<=n;i++)
if(d[i]==0 and i!=nod)
cout<<"-1 ";
else
cout<<d[i]<<" ";
return 0;
}