Cod sursa(job #3263721)

Utilizator isache_sabinaIsache Sabina isache_sabina Data 16 decembrie 2024 11:27:02
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#include <vector>
#define NMAX 100002

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

int n, start, C[NMAX], inc, sf;
vector <int> a[NMAX];
int viz[NMAX];
void citire();
void bfs(int x);

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, y, i,x;
    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++];
        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];
        }
    }
}