Cod sursa(job #3245782)

Utilizator Deleanu_LucaDeleanu Luca Deleanu_Luca Data 30 septembrie 2024 17:08:34
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100100

using namespace std;

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

int n,m,s;
vector<int> G[NMAX];
queue<int> C;
int viz[NMAX];

void citire();
void BFS(int start);

int main()
{
    int i;
    citire();

    BFS(s);

    for(i=1; i<=n; i++)
        fout<<viz[i]-1<<' ';

    return 0;
}

void citire()
{
    int i,x,y;

    fin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void BFS(int start)
{
    int i,u;
    viz[start]=1;
    C.push(start);
    while(!C.empty())
    {
        u=C.front();
        C.pop();
        for(i=0; i<G[u].size(); i++)
            if(!viz[G[u][i]])
            {
                viz[G[u][i]]=viz[u]+1;
                C.push(G[u][i]);
            }
    }
}