Pagini recente » Cod sursa (job #88836) | Cod sursa (job #2831209) | Cod sursa (job #233821) | Cod sursa (job #3190285) | Cod sursa (job #393607)
Cod sursa(job #393607)
#include<cstdio>
#include<vector>
using namespace std;
const int N=100000;
vector<int> a[N];
int n,s,m;
void read()
{
freopen("bfs.in","r",stdin);
int x,y;
scanf("%d%d%d", &n ,&m ,&s);
while(m--)
{
scanf("%d%d",&x,&y);
a[x].push_back(y);
}
}
int d[N]={-1},c[N];
char viz[N];
//int pred[N]; nu il apelez nicaieri
void bfs(int x)
{
int y,p=0,u=0;
c[1]=x;
d[x]=0;
//pred[x]=0;
while(p<=u)//coada nevida
{
//tai pe x din coada
for(int i=0;i<a[x].size();i++)
{
y=a[x][i];
if(!viz[y] )//nevizitat
{
d[y]=1+d[x];
u++;
c[u]=y;
viz[y]=1;
}
// pred[y]=x;
}
p++;
}
}
int main()
{
freopen("bfs.out","w",stdout);
read();
bfs(s);
for(int i=1;i<=n;i++)
printf("%d ",d[i]);
return 0;
}