Pagini recente » Cod sursa (job #1375475) | Cod sursa (job #85152) | Cod sursa (job #638465) | Cod sursa (job #1689254) | Cod sursa (job #1505505)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>b[100001];
int c[100001], n, viz[100001];
void BFS(int x)
{ int p,u,z,j,w;
c[1]=x;
p=u=1;
viz[x]=1;
while(p<=u)
{ z=c[p];
p++;
for(j=0;j<b[z].size() ;j++)
{ w=b[z][j];
if(!viz[w])
{ u++;
c[u]=w;
viz[w]=viz[z]+1;
}
}
}
}
int main()
{ int m,s,x,y,i;
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{ fin>>x>>y;
b[x].push_back(y);
}
BFS(s);
for(i=1;i<=n;i++)
fout<<viz[i]-1<<" ";
}