Cod sursa(job #625828)

Utilizator sanda-mariaPatras Sanda sanda-maria Data 25 octombrie 2011 17:48:21
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include<fstream>
#include <vector>
using namespace std;
int viz[100005],n,m,x,y,cont=1,c[100001],s;
double long k,cost[100001];
vector <int> A[100001];
 ofstream g("bfs.out");
void citire_graf()
{
     ifstream f("bfs.in");
     int x,y,i;
     f>>n>>m>>s;
     for(i=1;i<=m;i++)
      {
          f>>x>>y;
          A[x].push_back(y);
      }
          f.close();
}
       
void bfs(int s)
{
     int li,ls,i,nr_vecini,nod;
     li=1;
     ls=1;
     c[li]=s;
     viz[s]=1;
     while (li<=ls)
          {nod=c[li];
          nr_vecini=A[nod].size();
          for(i=0;i<nr_vecini;i++)
             if (viz[A[nod][i]]==0)
               {ls++;  
               c[ls]=A[nod][i];
               viz[A[nod][i]]=1;
               cost[A[nod][i]]=cost[nod]+1;
               }
          li++;
          }
} 

int main()
{ 
    int i;
    citire_graf();
    bfs(s);
    for(i=1;i<=n;i++)
       if (cost[i]!=0||i==k) g<<cost[i]<<" "; 
       else g<<-1<<" ";
    g.close();
    return 0;
}