Cod sursa(job #2296996)

Utilizator VladTZYVlad Tiganila VladTZY Data 5 decembrie 2018 10:20:54
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>
#include <vector>
#include <queue>

#define NMAX 100007

using namespace std;

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

int viz[NMAX],n,m,s;
queue <int> q;
vector <int> v[NMAX];


void BFS(int s)
{
    int x,y;
    q.push(s);
    viz[s]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0;i<v[x].size();i++)
        {
            y=v[x][i];
            if(viz[y]==0)
            {
                q.push(y);
                viz[y]=viz[x]+1;
            }
        }
    }
}

int main()
{
    int i,x,y;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    BFS(s);
    for(i=1;i<=n;i++)
    {
        g<<viz[i]-1<<" ";
    }
    return 0;
}