Pagini recente » Cod sursa (job #812579) | Cod sursa (job #2330455) | Cod sursa (job #508571) | Clasament Teme ACM Unibuc 2013 | Cod sursa (job #1292342)
#include<fstream>
#define N 10006
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
char a[N][N];
int viz[N];
int C[N];
int nr[N];
int main()
{ int i,x,y;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{ f>>x>>y;
a[x][y]=1;
}
for(i=1;i<=n;i++) nr[i]=-1;
viz[s]=1;
C[1]=s;
nr[s]=0;
int p=1,u=1;
while(p<=u)
{ int v=C[p++];
for(i=1;i<=n;i++)
if(viz[i]==0 && a[v][i]==1) {C[++u]=i; nr[i]=nr[v]+1; viz[i]=1;}
}
for(i=1;i<=n;i++) g<<nr[i]<<" ";
g<<'\n'; g.close(); return 0;
}