Pagini recente » Cod sursa (job #3191997) | Cod sursa (job #805367) | Cod sursa (job #2949215) | Cod sursa (job #753294) | Cod sursa (job #1352277)
#include <fstream>
#include<iostream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int i,j,m,n,s,x,y,k,a[10001][10001],viz[10001],q[10001],dist[10001];
void bfs (int x)
{
int k=0;
viz[x]=1;
// q[++k]=x;
for (i=1;i<=n;++i)
if (a[x][i]==1 && viz[i]==0)
q[++k]=i;
for (j=1;j<=k;++j)
{
if(viz[q[j]]==0)
dist[q[j]]=dist[x]+1;
bfs(q[j]); }
}
int main()
{
fin>>n>>m>>s;
for (i=1;i<=m;++i)
{
fin>>x>>y;
a[x][y]=1;
}
bfs(s);
for (i=1;i<=n;++i)
if (dist[i]==0 && i!=s)
fout<<"-1 ";
else
fout<<dist[i]<<" ";
return 0;
}