Cod sursa(job #2970505)

Utilizator AntoniaPopoviciAntonia-Adelina Popovici AntoniaPopovici Data 25 ianuarie 2023 12:17:49
Problema BFS - Parcurgere in latime Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.42 kb
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define NMAX 1000

vector<int> graf[NMAX];
// vector<int> grafTr[NMAX]; 
int n, m;
queue<int> q;
int dist[NMAX];

void bfs(int sursa)
{
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    q.push(sursa);
    dist[sursa] = 0;
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int vecin : graf[nod])
            if (dist[vecin] == -1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
    }
}

int main()
{
    int s;
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        fin >> a >> b;
        graf[a].push_back(b);
        //       grafTr[b].push_back(a);
    }

    bfs(s);

    //    fout << "HELLO" << endl;

    for (int i = 1; i <= n; i++)
    {
        fout << dist[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}