Pagini recente » Cod sursa (job #1147805) | Cod sursa (job #2970857) | Cod sursa (job #2790117) | Cod sursa (job #1359) | Cod sursa (job #2047430)
#include <fstream>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
struct nod
{
int vf;
nod *urm;
};
int n,m,s,c[100005],viz[100005];
nod *prim[100005];
void adaugare (int x,int y)
{
nod *p;
p=new nod;
p->vf=y;
p->urm=prim[x];
prim[x]=p;
}
int main()
{
int x,y,p,u;
in>>n>>m>>s;
for (int i=1;i<=m;i++)
{
in>>x>>y;
adaugare(x,y);
}
p=u=1;
c[1]=s;
viz[s]=1;
while (p<=u)
{
x=c[p];
p++;
for (nod *q=prim[x];q;q=q->urm)
{
if (viz[q->vf]==0)
{
u++;
c[u]=q->vf;
viz[q->vf]=1+viz[x];
}
}
}
for (int i=1;i<=n;i++)
out<<viz[i]-1<<" ";
return 0;
}