Pagini recente » Cod sursa (job #2814678) | Cod sursa (job #2916558) | Cod sursa (job #900248) | Cod sursa (job #884411) | Cod sursa (job #2953522)
#include <fstream>
#include <vector>
#include <deque>
#define DIM 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,p,x,y,d[DIM];
vector<int> l[DIM];
deque<int> q;
int main() {
fin>>n>>m>>p;
while (m--) {
fin>>x>>y;
l[x].push_back(y);
}
for (int i=1;i<=n;i++)
d[i]=-1;
q.push_back(p);
d[p]=0;
while (!q.empty()) {
int nod=q.front();
q.pop_front();
for (int i=0;i<l[nod].size();i++) {
int vec=l[nod][i];
if (d[vec]==-1) {
q.push_back(vec);
d[vec]=d[nod]+1;
}
}
}
for (int i=1;i<=n;i++)
fout<<d[i]<<" ";
return 0;
}