Cod sursa(job #1304449)

Utilizator ovidiuz98Zamfir Ovidiu ovidiuz98 Data 28 decembrie 2014 22:14:34
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
#include <vector>
#define DIM 100002
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,x,g,y,viz[DIM],C[DIM];
vector <int> v[DIM];
void BFS(int x){
    int p,u;
    viz[x]=1;
    C[1]=x;p=u=1;
    while(p<=u){
        x=C[p++];
        for(int i=0;i<v[x].size();i++){
            if(!viz[v[x][i]]){
                viz[v[x][i]]=viz[x]+1;
                C[++u]=v[x][i];
            }
        }
    }
}
int main(){
    fin>>n>>m>>x;
    for(int i=1;i<=m;i++){
        fin>>g>>y;
        v[g].push_back(y);
    }
    BFS(x);
    for(int i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
    fin.close();fout.close();
    return 0;
}