Pagini recente » Cod sursa (job #1697276) | Cod sursa (job #27696) | Cod sursa (job #1086842) | Cod sursa (job #2587728) | Cod sursa (job #3297392)
#include <bits/stdc++.h>
#define NMAX 100000
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, start, a, b;
vector<int> graf[NMAX + 2];
vector<int> dist(NMAX + 2, -1);
queue<int> q;
int main() {
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
fin >> n >> m >> start;
while (m--) {
fin >> a >> b;
graf[a].emplace_back(b);
}
q.push(start);
dist[start] = 0;
while (!q.empty()) {
int nod = q.front();
q.pop();
for (int vec : graf[nod]) {
if (dist[vec] == -1) {
dist[vec] = dist[nod] + 1;
q.push(vec);
}
}
}
for (int i = 1; i <= n; i++) {
fout << dist[i] << ' ';
}
return 0;
}