Pagini recente » Cod sursa (job #2519574) | Cod sursa (job #2066064) | Cod sursa (job #162938) | Cod sursa (job #1637068) | Cod sursa (job #1356128)
#include<fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
long a[1000][1000],k,n,m,p[1000],d[1000],x[1000];
void citire()
{
int i,j,x;
fin>>n>>m>>k;
for(x=1;x<=m;x++)
{ fin>>i>>j;
a[i][j]=1;
//a[j][i]=1;
}
}
void bf(int k)
{
int st,dr,j;
st=dr=1;
x[1]=k;
p[k]=1;
d[k]=0;
while(st<=dr)
{
for(j=1;j<=n;j++)
if(a[x[st]][j]==1 && p[j]==0)
{
dr++;
x[dr]=j;
p[j]=1;
d[j]=d[x[st]]+1;
}
st++;
}
}
void afis()
{
int i;
for(i=1;i<=n;i++)
if(d[i]!=100000) fout<<d[i]<<" ";
else fout<<"-1"<<" ";
}
int main()
{
citire();
for(int i=1;i<=n;i++) d[i]=100000;
bf(k);
afis();
fin.close();
fout.close();
return 0;
}