Pagini recente » Cod sursa (job #2236396) | Cod sursa (job #1266840) | Cod sursa (job #1559569) | Cod sursa (job #1736961) | Cod sursa (job #1846087)
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int coada[100000],pi,ps,d[100000],a[10000][10000],s,n,m;
void bf()
{
coada[1]=s;
ps=1;
pi=1;
while(ps<=pi)
{
for(int i=1;i<=n;i++)
if(a[coada[ps]][i]==1)
{
if(d[i]==0)
d[i]=d[coada[ps]]+1,coada[++pi]=i;
}
++ps;
}
}
int main()
{
int x,y;
f>>n>>m>>s;
for(int i=1;i<=m;i++)
{
f>>x>>y;
if(x!=y)
a[x][y]=1;
}
bf(); d[s]=0;
for(int i=1;i<=n;i++)
if(d[i]==0 && s!=i)
d[i]=-1;
for(int i=1;i<=n;i++)
g<<d[i]<<" ";
return 0;
}