Pagini recente » Cod sursa (job #1841474) | Cod sursa (job #1410284) | Cod sursa (job #2100001) | Cod sursa (job #2249886) | Cod sursa (job #2491073)
#include<fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs..out");
const int VM=10000003;
int lst[VM],q[VM],d[VM],vf[2*VM],urm[2*VM],nr;
void adauga(int x,int y)
{
nr++;
vf[nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void bfs(int s)
{
int i,st,dr,x,y,p;
for(i=1;i<=VM;i++)
d[i]=-1;
st=0;
dr=0;
q[dr]=s;
d[s]=0;
while(st<=dr)
{
x=q[st++];
for(p=lst[x];p!=0;p=urm[p])
{
y=vf[p];
if(d[y]==-1)
{
q[++dr]=y;
d[y]=d[x]+1;
}
}
}
}
int main()
{
int m,n,s,i,a,b;
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>a>>b;
adauga(a,b);
}
fin.close();
bfs(s);
for(i=1;i<<=n;i++)
fout<<d[i]<<" ";
fout.close();
return 0;
}