Cod sursa(job #403310)

Utilizator butabuta radu gabriel buta Data 24 februarie 2010 20:31:52
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
//parcurgerea in latime
#include<fstream>
#include<iostream>
using namespace std;

int n, a[50][50], c[50], viz[50],s;
void citire()
{
     int i,j;
  ifstream f("bfs.in");
     f>>n>>s;
   for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
     f>>a[i][j];
   f.close();
}

void bfs(int nod)
{
   int li, ls,i;
   li=1;ls=1;
   c[li]=nod;
   viz[nod]=1;
   
   while(li<=ls)
   {
     for(i=1;i<=n;i++)
       if(a[c[li]][i]==1&&viz[i]==0)
          {
            ls++;
            c[ls]=i;
            viz[i]=1;
          }
     li++;
     }
}

void afisare()
{ofstream g("bfs.out");
     int i;
  for(i=1;i<=n;i++)
    g<<c[i]<<" ";
}

int main()
{
    citire();
    bfs(s);
    afisare();

    
    return 0;
}