Cod sursa(job #2801391)
| Utilizator | Data | 16 noiembrie 2021 10:02:01 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("BFS.in");
ofstream cout("BFS.out");
int cer[101],aux[101][101],viz[101];
int main()
{
int x,y,i,z,u,p,k,n,m;
cin>>n>>m;
cin>>k;
for(i=1; i<=m; i++)
{
cin>>x>>y;
aux[x][y]=1;
aux[y][x]=1;
}
p=u=1;
cer[p]=k;
viz[k]=1;
while(p<=u)
{
z=cer[p];
for(i=1; i<=n; i++)
if(aux[z][i]==1 && viz[i]==0)
{
u++;
cer[u]=i;
viz[i]=1;
}
p++;
}
for(i=1; i<=u; i++)
cout<<cer[i]<<' ';
return 0;
}
