Pagini recente » Cod sursa (job #1179382) | Cod sursa (job #3288103) | Cod sursa (job #3276012) | Cod sursa (job #1467950) | Cod sursa (job #3005164)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int>v[100005];
int n, m, s, x, y, d[100005];
int main()
{
cin >> n >> m >> s;
while ( cin >> x >> y )
{
v[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:v[x] )
{
if ( d[y] == -1 )
{
d[y] = 1 + d[x];
q.push(y);
}
}
}
for ( int i = 1; i <= n; i++ )
{
cout << d[i] << " ";
}
}