Pagini recente » Cod sursa (job #905758) | Cod sursa (job #588687) | Cod sursa (job #998011) | Borderou de evaluare (job #1969904) | Cod sursa (job #1456457)
#include<fstream>
#include<vector>
using namespace std;
vector <int> L[100007];
int x, y, i, n, m2, s, p, u, m[100007], q[100007], nod, fiu;
ifstream in("bfs.in");
ofstream out("bfs.out");
int main(){
in>>n>>m2>>s;
for(i=1; i<=m2; i++){
in>>x>>y;
L[x].push_back(y);
}
m[s]=1;
p=1; u=1;
q[1]=s;
while(p<=u){
nod=q[p];
for(i=0; i<L[nod].size(); i++){
fiu=L[nod][i];
if(m[fiu]==0){
q[++u]=fiu;
m[fiu]=m[nod]+1;
}
}
p++;
}
for(i=1; i<=n; i++)
out<<m[i]-1<<" ";
return 0;
}