Cod sursa(job #811188)

Utilizator daniel11daniel fratila daniel11 Data 11 noiembrie 2012 17:39:14
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb

#include<fstream>
using namespace std;
ofstream g("bfs.out");
int a[40][40],n,coada[30],ic,sf,i,v[50],j;

void bf(int nod)
{
  coada[ic]=nod;
  v[nod]=1;
  while(ic<=sf)
  {
    i=1;
    while(i<=n)
    {
      if(a[coada[ic]][i]==1&&v[i]==0)
      {
	sf++;
	coada[sf]=i;
	v[i]=1;
	}
	i++;
      }
     g<<coada[ic]<<" ";
     ic++;
   }

}

int main()
{

  ifstream f("bfs.in");
  f>>n;
  while(f>>i>>j)
  a[i][j]=a[j][i]=1;

  ic=1;
  sf=1;
  bf(1);
  return 0;
}