Cod sursa(job #3263715)

Utilizator Mateiserban2007Serban Matei-David Mateiserban2007 Data 16 decembrie 2024 11:24:16
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, start;
vector<int>a[NMAX];
int viz[NMAX];
int c[NMAX];
int inc, sf;
void citire();
void bfs(int x);
int main()
{
    int i;
    citire();
    bfs(start);
    for(i=1; i<=n; i++)
      {
        fout<<viz[i]-1<<' ';
      }
    return 0;
}
void citire()
{
    int m, i, x, y;
    fin>>n>>m>>start;
    for(i=0; i<m; i++)
      {
        fin>>x>>y;
        //y inra 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++];
        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];
            }
        }
       }
}