Pagini recente » Cod sursa (job #527960) | Cod sursa (job #1724389) | Cod sursa (job #2062272) | Cod sursa (job #2285499) | Cod sursa (job #1968451)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int i,j,n,m,s,p,u,d[100001],q[200001],x,y,viz[100001];
vector <int> G[100001];
void bfs(){
while(p<=u){
for(int i=0;i<G[q[p]].size();i++)
if(viz[G[q[p]][i]]==0){
d[G[q[p]][i]]=d[q[p]]+1;
q[++u]=G[q[p]][i];
viz[q[u]]=1;
}
p++;
}
}
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++){
f>>x>>y;
d[i]=-1;
G[x].push_back(y);
}
d[s]=0;
p=u=1;
q[1]=s;
viz[s]=1;
bfs();
for(i=1;i<=n;i++)
g<<d[i]<<" ";
return 0;
}