Pagini recente » Cod sursa (job #3193200) | Cod sursa (job #1899182) | Cod sursa (job #2636449) | Cod sursa (job #356359) | Cod sursa (job #2257153)
#include <bits/stdc++.h>
#define NMAX 255
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int m,n;
vector <int> mv[100005];
queue <int> q;
int viz[100005];
int v[100005];
void BFS(int val){
int i;
viz[val]=1;
q.push(val);
while(!q.empty()){
val=q.front();
q.pop();
for(i=0;i<mv[val].size();i++){
if(!viz[mv[val][i]]){
viz[mv[val][i]]=1;
v[mv[val][i]]=v[val]+1;
q.push(mv[val][i]);
}
}
}
}
int main(){
int i,j,x,y,s;
fin>>n>>m>>s;
for(i=1;i<=m;i++){
fin>>x>>y;
mv[x].push_back(y);
}
BFS(s);
for(i=1;i<=n;i++)
if(viz[i])
fout<<v[i]<<" ";
else fout<<-1<<" ";
return 0;
}