Cod sursa(job #3263744)

Utilizator MateiPRPrepelita Matei MateiPR Data 16 decembrie 2024 11:38:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
#include <vector>
#define NMAX 100010

using namespace std;

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

int n, start;
void citire();
void BFS(int x);
vector <int> a[NMAX];
int viz[NMAX];
//viz[i]=0 daca nu a fost vizitat sau nrul de varfuti vizitate
int C[NMAX];
int inc, sf;

int main()
{int i;

 citire();
 BFS(start);
 for(i=1; i<=n; i++) fout<<viz[i]-1<<' ';
 fout.close();

    return 0;
}

 void citire()
{int m, i, x, y;
 fin>>n>>m>>start;
 for(i=0; i<m; i++)
   {fin>>x>>y;
    //y intra in lista de adiacenta a lui x
    a[x].push_back(y);
   }
}


 void BFS(int x)
{int i;
 viz[x]=1;
 C[1]=x; inc=sf=1;
 while(inc<=sf)
      {x=C[inc++];
      //parcurc
       for(i=0; i<a[x].size(); i++)
          if(!viz[a[x][i]])
            {viz[a[x][i]]=1+viz[x];
             C[++sf]=a[x][i];
            }
      }
}