Pagini recente » Cod sursa (job #1743863) | Cod sursa (job #964229) | Cod sursa (job #1338326) | Cod sursa (job #721814) | Cod sursa (job #2858183)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y;
int c[100001], q[100001];
vector <int> v[100001];
void bfs(int s){
int st = 1, dr = 1;
q[1] = s;
c[s] = 0;
while(st <= dr){
int i = q[st];
for(int j=0; j<v[i].size(); j++){
// fout << i <<' '<<v[i][j]<<' '<<c[v[i][j]]<<'\n';
if(c[v[i][j]] == -1){
dr++;
q[dr] = v[i][j];
c[v[i][j]] = c[i] + 1;
//fout << q[dr] << '\n';
}
}
st++;
//fout << st << ' ' << dr << '\n';
}
}
int main(){
fin >> n >> m >> s;
for(int i=1; i<=m; i++){
fin >> x >> y;
v[x].push_back(y);
}
for(int i=1; i<=n; i++)
c[i] = -1;
bfs(s);
for(int i=1; i<=n; i++)
fout << c[i] << ' ';
return 0;
}