Mai intai trebuie sa te autentifici.
Cod sursa(job #544777)
| Utilizator | Data | 2 martie 2011 09:11:18 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,i,x,y,a[100][100],pa[10000],p,u,d,c[1000],viz[1000];
int main()
{
f>>n>>m>>s;
cout<<n<<m<<s;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=1;
}
for (i=1;i<=n;i++)
pa[i]=-1;
p=u=1; pa[s]=0;
c[p]=s;
viz[s]=1;
while(p<=u)
{
x=c[p];
//cautam vf adiacente
for(i=1;i<=n;i++)
if(a[x][i]==1 && viz[i]==0)
{
u++;
pa[i]=pa[x]+1;
c[u]=i;
viz[i]=1;
}
p++;
}
for(i=1;i<=n;i++)
g<<pa[i]<<" ";
return 0;
}
