Pagini recente » Cod sursa (job #1112412) | Cod sursa (job #1122077) | Cod sursa (job #984007) | Cod sursa (job #892137) | Cod sursa (job #403309)
Cod sursa(job #403309)
//parcurgerea in latime
#include<fstream>
#include<iostream>
using namespace std;
int n, a[50][50], c[50], viz[50],s;
void citire()
{
int i,j;
ifstream f("bfs.in");
f>>n>>s;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
}
void bfs(int nod)
{
int li, ls,i;
li=1;ls=1;
c[li]=nod;
viz[nod]=1;
while(li<=ls)
{
for(i=1;i<=n;i++)
if(a[c[li]][i]==1&&viz[i]==0)
{
ls++;
c[ls]=i;
viz[i]=1;
}
li++;
}
}
void afisare()
{int i;
for(i=1;i<=n;i++)
cout<<c[i]<<" ";
}
int main()
{
citire();
bfs(s);
afisare();
system ("pause");
return 0;
}