Pagini recente » Cod sursa (job #639186) | Cod sursa (job #688416) | Cod sursa (job #1669885) | Cod sursa (job #248178) | Cod sursa (job #544778)
Cod sursa(job #544778)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,i,x,y,a[100001][100001],pa[100000],p,u,d,c[100000],viz[100000];
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
for (i=1;i<=n;i++)
pa[i]=-1;
p=u=1; pa[s]=0;
c[p]=s;
viz[s]=1;
while(p<=u)
{
x=c[p];
//cautam vf adiacente
for(i=1;i<=n;i++)
if(a[x][i]==1 && viz[i]==0)
{
u++;
pa[i]=pa[x]+1;
c[u]=i;
viz[i]=1;
}
p++;
}
for(i=1;i<=n;i++)
g<<pa[i]<<" ";
return 0;
}