Cod sursa(job #2408478)
| Utilizator | Data | 17 aprilie 2019 23:48:47 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int a[101][101],m,n,i,j,x,c[101],viz[101],t,p;
int main()
{
f>>n>>m>>x;
for(i=1;i<=m;i++){
f>>t>>p;
a[t][p]=a[p][t]=1;
}
c[1]=x;
p=1;t=1;
viz[x]=1;
while(p<=t)
{
x=c[p];
for(i=1;i<=n;i++)
if(a[x][i] && !viz[i])
{
t++;
c[t]=i;
viz[i]=1;
}
p++;
}
for(i=1;i<=t;i++)
g<<c[i]<<' ';
f.close();
g.close();
return 0;
}