Pagini recente » Cod sursa (job #861439) | Cod sursa (job #2335862) | Cod sursa (job #1436583) | Cod sursa (job #1178521) | Cod sursa (job #470705)
Cod sursa(job #470705)
#include <fstream>
using namespace std;
int coada[10000],viz[10000],a[5000][5000],prim,ultim,p,n,m,c;
void bfs()
{
while(prim<=ultim)
{
p=coada[prim];
for(int k=1;k<n;k++)
{
if(a[p][k] == 1 && viz[k] == 0)
{
coada[++ultim] = a[p][k];
viz[k] = 1;
}
}
prim++;
}
}
int main()
{
int x,y,i;
fstream f,g;
f.open("bfs.in",ios::in);
g.open("bfs.out",ios::out);
f>>c>>n>>m;
for(i=1,i<=n;i++)
{
f>>x>>y;
a[x][y]=a[y][x]=1;
}
prim=ultim=1;
viz[a] = 1;
coada[prim] = c;
bfs();
for(i=1;i<=ultim;i++)
g<<coada[i]<<"";
f.close();
g.close();
return 0;
}