Mai intai trebuie sa te autentifici.
Cod sursa(job #1847855)
Utilizator | Data | 15 ianuarie 2017 10:17:13 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include<fstream>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n, m, st, c[900], p, u, drum[900], k=0;
bool a[900][900], viz[900];
void bfs(){
while(p<=u){
st=c[p];
for(int i=1; i<=n; ++i){
if(a[st][i]==1 && viz[i]==0){
++u; c[u]=i; drum[i]=drum[st]+1;
viz[i]=1;
}
}
++p;
}
}
int main(){
cin>>n>>m>>st;
while(m--){
int x, y;
cin>>x>>y;
a[x][y]=1;
}
/* cout<<"Matricea de adiacenta:\n";
for(int i=1; i<=n; ++i){
for(int j=1; j<=n; ++j){
cout<<a[i][j]<<" ";
}
cout<<"\n";
}*/
p=u=1;
c[p]=st; viz[st]=1; drum[st]=0;
bfs();
// for(int i=1; i<=n; ++i) cout<<c[i]<<" ";
for(int i=1; i<=n; ++i) cout<<drum[i]<<" ";
return 0;
}