Pagini recente » Cod sursa (job #2492746) | Cod sursa (job #702181) | Cod sursa (job #114461) | Cod sursa (job #3183695) | Cod sursa (job #1846084)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,i,a[1000][1000],pi,ps,d[1000],coada[1000],s,x,y;
void citire()
{
f>>n>>m>>s;
for(int i=1;i<=m;i++)
{
f>>x>>y;
if(x!=y)
{a[x][y]=1;
}
}
}
void parcurgere()
{
pi=1;
ps=1;
coada[pi]=s;
while(ps<=pi)
{
for(int i=1;i<=n;i++)
{
if(a[coada[ps]][i]!=0 && d[i]==0)
{
d[i]=d[coada[ps]]+1;
coada[++pi]=i;
}
}
ps++;
}
}
void afisare()
{
d[s]=0;
for(int i=1;i<=n;i++)
if(d[i]==0 && i!=s)
{
g<<-1<<" ";
}
else g<<d[i]<<" ";
}
int main()
{
citire();
parcurgere();
afisare();
return 0;
}