Pagini recente » Cod sursa (job #1980606) | Cod sursa (job #375999) | Cod sursa (job #1642817) | Cod sursa (job #2031861) | Cod sursa (job #2678224)
#include <fstream>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n,m,k,i,x,y,a[101][101],c[101],viz[101],p,u;
int main()
{
fin>>n>>m>>k;
for (i=1; i<=m; i++)
{
fin>>x>>y;
a[x][y]=a[y][x]=1;
}
p=u=1;
c[u]=k;
viz[k]=1;
while (p<=u)
{fout<<c[p]<<" ";
for (i=1; i<=n; i++)
{
if (a[c[p]][i]==1&&viz[i]==0)
{
u++;
c[u]=i;
viz[i]=1;
}
}
p++;
}
return 0;
}