Cod sursa(job #2329204)

Utilizator Cosmin7Cosmin Cosmin7 Data 26 ianuarie 2019 14:29:54
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <fstream>
#include <vector>
#include <queue>

#define NMAX 100002

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> graf[NMAX];
queue <int> coada;

int viz[NMAX];
int n,m,start;

void citire()
{
    int x,y;
    f>>n>>m>>start;
    while(m)
    {
        f>>x>>y;
        graf[x].push_back(y);
        m--;
    }
}

void bfs(int start)
{
    int z;
    coada.push(start);
    viz[start]=1;
    while(!coada.empty())
    {
        z=coada.front();
        for(unsigned int i=0;i<graf[z].size();i++)
        {
            if(!viz[graf[z][i]])
            {
                coada.push(graf[z][i]);
                viz[graf[z][i]]=viz[z]+1;
            }
        }
        coada.pop();
    }
}

void afisare()
{
    int i;
    for(i=1;i<=n;i++)
        g<<viz[i]-1<<" ";
}
int main()
{
    citire();
    bfs(start);
    afisare();
    return 0;
}