Pagini recente » Cod sursa (job #988839) | Cod sursa (job #2431255) | Cod sursa (job #1759048) | Cod sursa (job #633621) | Cod sursa (job #3005174)
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,s,x,y,d[100001];
vector<int>a[100001];
int main()
{
cin>>n>>m>>s;
while ( cin >> x >> y )
{
a[x].push_back(y);
}
queue <int>q;
for(int i=1;i<=n;i++)
{
d[i]=-1;
}
d[s]=0;
q.push(s);
while(!q.empty())
{
int x=q.front();
q.pop();
for(auto y:a[x])
{
if(d[y]==-1)
{
d[y]=1+d[x];
q.push(y);
}
}
}
for ( int i = 1; i <= n; i++ )
{
cout << d[i] << " ";
}
}