Pagini recente » Cod sursa (job #2728260) | Cod sursa (job #2814761) | Cod sursa (job #308953) | Cod sursa (job #2787778) | Cod sursa (job #1830901)
#include <fstream>
using namespace std;
int viz[100001],p,u,c[100001];
struct nod
{
int inf;
nod* urm;
}*v[100010];
void adaugare (nod*&prim, int x)
{
nod*nou;
nou=new nod;
nou->inf=x;
nou->urm=NULL;
if(prim==NULL)
prim=nou;
else
{
nou->urm=prim;
prim=nou;
}
}
void BF (int x)
{
nod*t;
viz[x]=1;
p=u=1;
c[u]=x;
while(p<=u)
{
x=c[p];
for(t=v[x];t;t=t->urm)
if(viz[t->inf]==0)
{
u++;
c[u]=t->inf;
viz[t->inf]=viz[x]+1;
}
p++;
}
}
int main()
{
int n,m,s,i,x,y;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
adaugare(v[x],y);
}
BF(s);
for(i=1;i<=n;i++)
fout<<viz[i]-1<<" ";
return 0;
}