Pagini recente » Cod sursa (job #2423610) | Cod sursa (job #1838928) | Cod sursa (job #2427330) | Cod sursa (job #2427355) | Cod sursa (job #2408477)
#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;
}