Pagini recente » Cod sursa (job #872186) | emagcluj_9_2016 | Cod sursa (job #821260) | Cod sursa (job #2831019) | Cod sursa (job #1436131)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int nmax=100000;
vector <int> g[nmax+1];
int d[nmax+1] , q[nmax+1];
int main()
{
int n,m,s,a,b;
fin>>n>>m>>s;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
g[x].push_back(y);
}
for(int i=1;i<=m;i++)
d[i]=-1;
d[s]=0;
q[1]=s;
a=1;
b=1;
while(a<=b)
{
int x=q[a];
a=a+1;
for(int i=0;i<(int)g[x].size();i++)
{
int y=g[x][i];
if(d[y]==-1)
{
q[b+1]=y;
b+=1;
d[y]=d[x]+1;
}
}
}
for(int i=1;i<=n;i++)
fout<<d[i]<<" ";
fout<<"\n";
return 0;
}