Cod sursa(job #393609)

Utilizator alex@ndraAlexandra alex@ndra Data 9 februarie 2010 18:45:30
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include<fstream>
using namespace std;

long n,m, a[1001][1001], c[1001],cost[1001],s,x,y;
void citire()
{
     int i;
  ifstream f("bfs.in");
     f>>n>>m>>s;
   for(i=1;i<=m;i++)
    {
       f>>x>>y;
       a[x][y]=1;
     }
   f.close();
   
   for(i=1;i<=n;i++)
     cost[i]=-1;
}

void bfs(int nod)
{
   int li, ls,i;
   li=1;ls=1;
   c[li]=nod;
   cost[nod]=0;

   
   while(li<=ls)
   {
     for(i=1;i<=n;i++)
       if(a[c[li]][i]==1&&cost[i]==-1)
          {
            ls++;
            c[ls]=i;
            cost[i]=cost[c[li]]+1;
          }
     li++;
     }
}

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

int main()
{
    citire();
    bfs(s);
    afisare();
       
    return 0;
}