Pagini recente » Cod sursa (job #1081381) | Cod sursa (job #1363843) | Cod sursa (job #1715635) | Cod sursa (job #2785074) | Cod sursa (job #1712915)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=10001;
int n, m, S;
bool viz[N];
vector <int> a[N];
int pred[N], d[N], q[N];
void bfs (int x)
{
int p,u,i;
for(i=1;i<=n;i++)
d[i]=-1;
p=u=0;
q[u++]=S;
q[S]=0;
while(p<u)
{
x=q[p++];
for(i=0;i<a[x].size();i++)
{ int y=a[x][i];
if(d[y] == -1)
{
q[u++]=y;
d[y]=1+d[x];
pred[y]=x;
}
}
}
}
int main()
{
int x,y,i;
in>>n>>m>>S;
for(i=1;i<=m;i++)
{
in>>x>>y;
a[x].push_back(y);
}
bfs(S);
for(i=1;i<=n;i++)
out<<d[i]<<" ";
return 0;
}