Pagini recente » Cod sursa (job #3274611) | Cod sursa (job #964061) | Cod sursa (job #1871612) | Cod sursa (job #2114391) | Cod sursa (job #1318374)
#include <iostream>
#include <fstream>
using namespace std;
//http://www.infoarena.ro/problema/bfs
int a[100001][100001],viz[100001],n,s;
void citire()
{
int m,x,y;
ifstream f("bfs.in");
f>>n>>m>>s;
for(int i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
f.close();
}
void BF(int xp)
{
int c[100001],p,u,i,k;
p=u=1;
c[p]=xp;viz[xp]=1;
while (p<=u)
{
k=c[p];
for(i=1;i<=n;i++)
{
if(a[k][i]==1 && viz[i]==0)
{
u++;c[u]=i; viz[i]=viz[k]+1;
}
}
p++;
}
}
int main()
{
citire();
BF(s);
int i;
ofstream g("bfs.out");
for(i=1;i<=n;i++) g<<viz[i]-1<<' ';
g.close();
}