Cod sursa(job #259582)

Utilizator vladbBogolin Vlad vladb Data 15 februarie 2009 15:16:40
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.53 kb
#include<fstream.h>

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,s,d,a[100][100],t[100],e,p[1000],nod;

int main()
{   int x,y,i;
	fin>>n>>m;
	for(i=1;i<=m;i++)
	{	fin>>x>>y;
		a[x][0]++;
		a[x][a[x][0]]=y;
		a[y][0]++;
		a[y][a[y][0]]=x;
	}
    t[1]=1;
	p[1]=1;
	s=1;
	d=1;
	while(s<=d)
	{	for(i=1;i<=a[t[s]][0];i++)
			if(p[a[t[s]][i]]==0)
			{	d++;
				p[a[t[s]][i]]=1;
				t[d]=a[t[s]][i];
			}
		s++;
	}
	for(i=1;i<=n;i++)
		fout<<t[i]<<" ";
	fin.close();
	fout.close();
	return 0;
}