Cod sursa(job #2199845)

Utilizator sichetpaulSichet Paul sichetpaul Data 29 aprilie 2018 12:34:19
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#include <vector>
#define DIM 100001
using namespace std;
vector <int> v[DIM];
int d[DIM];bool viz[DIM];
void BFS(int nod) {
   viz[nod]=1;
   for (unsigned int j=0;j<v[nod].size();++j)
       if (!viz[v[nod][j]]) {
            d[v[nod][j]]=d[nod]+1;
            BFS(v[nod][j]);
    }
}
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;BFS(s);
    for (i=1;i<=n;++i)
        g<<d[i]<<" ";
    return 0;
}