Pagini recente » Cod sursa (job #2663577) | Cod sursa (job #356125) | Cod sursa (job #3254465) | Cod sursa (job #2714848) | Cod sursa (job #393599)
Cod sursa(job #393599)
#include<fstream>
using namespace std;
long n,m, a[10001][10001], c[10001],cost[10001], viz[10001],s,x,y;
void citire()
{
int i,j;
ifstream f("bfs.in");
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
f.close();
}
void bfs(int nod)
{
int li, ls,i;
li=1;ls=1;
c[li]=nod;
cost[nod]=1;
viz[nod]=1;
while(li<=ls)
{
for(i=1;i<=n;i++)
if(a[c[li]][i]==1&&viz[i]==0)
{
ls++;
cost[ls]=cost[li]+1;
c[ls]=i;
viz[i]=1;
}
li++;
}
}
void afisare()
{
int i;
ofstream g("bfs.out");
for(i=1;i<=n;i++)
g<<cost[i]-1<<" ";
g.close();
}
int main()
{
citire();
bfs(s);
afisare();
return 0;
}