Pagini recente » Cod sursa (job #1894751) | Cod sursa (job #1292974) | Cod sursa (job #2691844) | Cod sursa (job #2969840) | Cod sursa (job #2808020)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> lista[100001];
int q[100001],v[100001];
int main ()
{
int n,m,s,i,x,y,st,dr,nod;
fin>>n>>m>>s;
for (i=1;i<=m;i++)
{
fin>>x>>y;
lista[x].push_back(y);
}
q[1]=s;
st=dr=1;
v[s]=1;
while (st<=dr)
{
nod=q[st];
for (i=0;i<lista[nod].size();i++)
if (v[lista[nod][i]]==0)
{
dr++;
q[dr]=lista[nod][i];
v[lista[nod][i]]=v[nod]+1;
}
st++;
}
for (i=1;i<=n;i++)
fout<<v[i]-1<<" ";
return 0;
}