Mai intai trebuie sa te autentifici.
Cod sursa(job #393419)
| Utilizator | Data | 9 februarie 2010 14:09:57 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream.h>
#include<iostream.h>
int n,m,s,coada[4001],sel[4001],li,ls,a[4001][4001];
int main()
{
int n,m,s,li,ls,i;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
fin>>n>>m>>s;
for(i=1;i<=m;i++){
fin>>li>>ls;
a[li][ls]=1;
}
for(i=1;i<=n;i++)sel[i]=-1;
sel[s]=0;
li=1;
ls=1;
coada[li]=s;
while(li<=ls){
for(i=1;i<=n;i++)if(sel[i]==-1 && a[coada[li]][i]){
ls++;
coada[ls]=i;
sel[i]=sel[coada[li]]+1;
}
li++;
}
for(i=1;i<=n;i++)fout<<sel[i]<<' ';
return 0;
}
