Pagini recente » Cod sursa (job #582502) | Cod sursa (job #1199056) | Cod sursa (job #162798) | Cod sursa (job #2612658) | Cod sursa (job #2271690)
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<vector<int>> G;
vector<int> viz;
unsigned int n, a, i;
void rd()
{
int x, y;
f>>n>>a>>a;
viz.resize(n+1);
G.resize(n+1);
while(f>>x>>y)
G[x].push_back(y);
}
queue<int> q;
void BFS(int x)
{
viz[x]=1;
q.push(x);
while(q.size())
{
x=q.front();
q.pop();
for(auto a:G[x])
if(!viz[a])
{
viz[a]=viz[x]+1;
q.push(a);
}
}
}
void afis()
{
for(i=1;i<=n;i++)
g<<viz[i]-1<<' ';
}
int main()
{
rd();
BFS(a);
afis();
return 0;
}