Pagini recente » Cod sursa (job #2665091) | Cod sursa (job #645846) | Cod sursa (job #1612438) | Cod sursa (job #1021851) | Cod sursa (job #1882926)
#include <bits/stdc++.h>
#define nmax 100005
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
vector <int> V[nmax];
bool viz[nmax];
int nr[nmax];
void bfs()
{int i,v;
queue <int> C;
C.push(s); viz[s]=1;
while(!C.empty())
{v=C.front(); C.pop();
for(i=0;i<V[v].size();i++)
if(viz[V[v][i]]==0)
{C.push(V[v][i]); viz[V[v][i]]=1;
nr[V[v][i]]=nr[v]+1;
}
}
}
void read()
{int i,x,y;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{f>>x>>y;
V[x].push_back(y);
}
}
void af()
{int i;
for(i=1;i<=n;i++)
if(i==s) g<<0<<" ";
else
if(nr[i]>0) g<<nr[i]<<" ";
else g<<-1<<" ";
}
int main()
{read();
bfs();
af();
return 0;
}