Cod sursa(job #862627)
| Utilizator | Data | 22 ianuarie 2013 20:21:36 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#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;
}
