Cod sursa(job #1987687)
| Utilizator | Data | 31 mai 2017 18:31:32 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a[1000][1000],viz[1000],q[1000];
int main()
{int i,j,x,y,p,u,k;
f>>n>>m>>s;
for (i=1; i<=m; i++)
{
f>>x>>y;
a[x][y]=1;
}
p=1; q[p]=s; u=p; viz[s]=1;
while (p<=u)
{
k=q[p]; p++;
for (i=1; i<=n; i++)
if (a[k][i]==1 && viz[i]==0)
{
u++;
q[u]=i; viz[i]=viz[k]+1;
}
}
for(i=1;i<=n;i++) g<<viz[i]-1<<" ";
return 0;
}
