Pagini recente » Cod sursa (job #2973882) | Cod sursa (job #1442048) | Cod sursa (job #2167166) | Cod sursa (job #1876265) | Cod sursa (job #1148515)
#include <fstream>
#define NMAX 100001
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,cost[NMAX],viz[NMAX];
typedef struct nod
{
int y;
nod *urm;
}*pNod;
pNod lis[NMAX];
void add(pNod &dest,int val)
{
pNod p;
p=new nod;
p->y=val;
p->urm=dest;
dest=p;
}
void bfs(int s)
{
int pi,pf,c[NMAX];
for (int i=1;i<=n;++i)
cost[i]=-1;
pi=pf=1; cost[s]=0; viz[s]=1; c[1]=s;
while (pi<=pf)
{
for (pNod p=lis[c[pi]];p!=NULL;p=p->urm)
{
if (viz[p->y]==0)
{
pf++;
c[pf]=p->y;
viz[p->y]=1;
cost[p->y]=cost[c[pi]]+1;
}
}
pi++;
}
}
int main()
{
int m,s,x,y;
f>>n>>m>>s;
for (int i=1;i<=m;++i)
{
f>>x>>y;
add(lis[x],y);
}
bfs(s);
for (int i=1;i<=n;++i)
g<<cost[i]<<" ";
f.close();
g.close();
return 0;
}