Pagini recente » Cod sursa (job #633343) | Cod sursa (job #1059927) | Cod sursa (job #2461352) | Cod sursa (job #107421) | Cod sursa (job #1428553)
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int i,n,m,x,y,nr[1001],c[1001],s;
bool viz[1001],a[1001][1001];
void bfs(int k)
{
int i,p,u;
viz[k]=1;
c[1]=k;
nr[k]=0;
p=u=1;
while(p<=u)
{
y=c[p];
for(i=1;i<=n;i++)
{
if(viz[i]==0 && a[y][i]==1)
{
u++;
c[u]=i;
nr[i]=nr[y]+1;
viz[i]=1;
}
}
p++;
}
}
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
bfs(s);
for(i=1;i<=n;i++)
{
if(viz[i]==0) nr[i]=-1;
}
for(i=1;i<=n;i++)
g<<nr[i]<<" ";
return 0;
}