Pagini recente » Cod sursa (job #1537203) | Cod sursa (job #850202) | Cod sursa (job #659394) | Cod sursa (job #1209750) | Cod sursa (job #2231165)
#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int NMAX = 1e5+5;
vector<int> v[NMAX];
int viz[NMAX];
int main()
{
int n,m,s;
in >> n >> m >> s;
for (int i = 1; i<=m; i++)
{
int x,y;
in >> x >> y;
v[x].push_back(y);
}
viz[s] = 1;
queue<int> q;
q.push(s);
while (!q.empty())
{
int now = q.front();
for (auto it: v[now])
if (!viz[it])
{
viz[it] = 1+viz[now];
q.push(it);
}
q.pop();
}
for (int i = 1; i<=n; i++)
out << viz[i]-1 << " ";
}