Pagini recente » Cod sursa (job #2321257) | Cod sursa (job #875486) | Cod sursa (job #2986315) | Cod sursa (job #1611033) | Cod sursa (job #1911004)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,viz[100001],c[100001],nr[100001],s;
vector <int> G[100001];
ifstream f("bfs.in");
ofstream g("bfs.out");
void bfs (int k)
{
int i,p,u,y,x;
p=u=1;
viz[k]=1;
c[1]=k;
nr[k]=0;
while(p<=u)
{
y=c[p];
for(i=0;i<G[y].size(); i++)
{
x=G[y][i];
if(viz[x]==0)
{
u++;
c[u]=x;
viz[x]=1;
nr[x]=nr[y]+1;
}
}
p++;
}
}
int main()
{
int i,x,y;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
}
bfs(s);
for(i=1;i<=n;i++)
if(viz[i]==0)
g<<"-1 ";
else
g<<nr[i]<<" ";
g<<"\n";
return 0;
}