Cod sursa(job #2199846)

Utilizator sichetpaulSichet Paul sichetpaul Data 29 aprilie 2018 12:41:15
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#include <vector>
#include <queue>
#define DIM 100001
using namespace std;
vector <int> v[DIM];
int d[DIM];bool viz[DIM];
queue <int> nod;
int main()
{   int n,m,s,i,x,y;
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f>>n>>m>>s;
    for (i=1;i<=n;++i)
        d[i]=-1;
    for (i=1;i<=m;++i) {
        f>>x>>y;
        if (x!=y) v[x].push_back(y);
    }

    d[s]=0;nod.push(s);
    while (!nod.empty()) {
        x=nod.front();
        viz[x]=1;
        for (unsigned int j=0;j<v[x].size();++j)
          if (!viz[v[x][j]]) {
               viz[v[x][j]]=1;
               d[v[x][j]]=d[x]+1;
               nod.push(v[x][j]);
          }
          nod.pop();
    }
    for (i=1;i<=n;++i)
        g<<d[i]<<" ";
    return 0;
}