Cod sursa(job #1848514)

Utilizator llalexandruLungu Alexandru Ioan llalexandru Data 16 ianuarie 2017 09:31:51
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> V[100005];

int n, m, s, i, x, y;
int F[100005], D[100005];

void BFS(int x, int pas)
{
    int i, y;
    for (i=0; i<V[x].size(); i++)
    {
        y=V[x][i];
        if (F[y]==0)
        {
            D[y]=pas;
            F[y]=1;
            BFS(y, pas+1);
        }
    }
}

int main()
{
    int i;
    fin>>n>>m>>s;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
    F[s]=1;
    for (i=1; i<=n; i++)
        D[i]=-1;
    D[s]=0;
    BFS(s, 1);
    for (i=1; i<=n; i++)
        fout<<D[i]<<" ";
    return 0;
}