Pagini recente » Cod sursa (job #2049388) | Cod sursa (job #2336823) | Cod sursa (job #2762772) | Cod sursa (job #760346) | Cod sursa (job #862627)
Cod sursa(job #862627)
#include<fstream>
using namespace std;
ifstream f("BFS.in");
ofstream g("BFS.out");
int n,x[101][101],a[101],b[101],i,j,p,nc,u;
int main(){
f>>n>>p;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>x[i][j];
a[1]=p;b[p]=1;nc=1;u=1;
while(u>=nc){
for(i=1;i<=n;++i)
if(x[a[nc]][i]==1&&b[i]==0){
u++; a[u]=i;b[i]=1;
}
nc++;
}
for(i=1;i<=n;++i) g<<a[i]<<' ';
g<<'\n';
return 0;
}