Pagini recente » Cod sursa (job #1931233) | Cod sursa (job #98454) | Cod sursa (job #3239572) | Cod sursa (job #2304103) | Cod sursa (job #2511660)
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int lst[100001], q[100001], d[100001];
int vf[2000001], urm[2000001], 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<=100001;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 n, m, 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;
}