Cod sursa(job #2827759)

Utilizator ioan_bogioan bogdan ioan_bog Data 6 ianuarie 2022 12:23:24
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int>v[100001];
queue<int>q;
int viz[100001];
int n,m,start;
void apel(int st)
{
    viz[st]=1;
    q.push(st);
    while(!q.empty())
    {
        int k=q.front();
        q.pop();
        for(vector<int>::iterator it=v[k].begin();it<v[k].end();it++)
        {
            if(!viz[*it])
            {
                q.push(*it);
                viz[*it]=viz[k]+1;
            }
        }

    }
    for(int i=1;i<=n;i++)
    {
        g<<viz[i]-1<<" ";
    }

}
int main(){
    f>>n>>m>>start;
    int i,j;
    for(int k=1;k<=m;k++)
    {
        f>>i>>j;
        v[i].push_back(j);
    }
    apel(start);

}