Cod sursa(job #630179)

Utilizator tzipleatudTudor Tiplea tzipleatud Data 4 noiembrie 2011 20:32:20
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <vector>
#include <bitset>
#include <cstring>
using namespace std;

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

int n,i,a,b,m,v[100001],s;
vector<int> A[100001];
bitset <100001> vi;

void bfs(int nod) {
    vector<int>::iterator it;
    int x;vi[nod]=1;
    for (it=A[nod].begin();it!=A[nod].end();it++) {
        x=*it;
        if (vi[x]==0) {v[x]=v[nod]+1;bfs(x);}
    }
    return;
}

int main () {
    f >> n >> m >> s;
    for (i=1;i<=m;i++) {
        f >> a >> b;
        A[a].push_back(b);
       // A[b].push_back(a);
    }
    memset(v,-1,sizeof(v));
    v[s]=0;bfs(s);
    for (i=1;i<=n;i++) g << v[i] << ' ';
    f.close();g.close();
    return 0;
}