Cod sursa(job #2205165)

Utilizator borscalinCalin-Stefan Georgescu borscalin Data 18 mai 2018 09:49:50
Problema BFS - Parcurgere in latime Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.94 kb
#include <stdio.h>
#include <stdlib.h>
#define NMAX 100000
#define MMAX 1000000

int n, m, p, nr, vf[1 + 2 * MMAX], urm[1 + 2 * MMAX], lst[1 + NMAX], viz[1 + NMAX], s, dist[1 + NMAX];
int ans;

void adauga ( int x, int y ) {
    ++nr;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfs ( int x , int cost ) {
    dist[x] = cost;
    viz[x] = 1;
    int p = lst[x], y;
    while ( p != 0 ) {
        y = vf[p];
        if ( !viz[y] )
            bfs ( y , cost + 1);
        p = urm[p];
    }
}

int main()
    int i, x, y;

    FILE *fin = fopen("bfs.in", "r");
    fscanf(fin, "%d%d%d", &n, &m, &s);
    for (i = 1; i <= n; ++i)
        dist[i] = -1;
    for (i = 1; i <= m; ++i) {
        fscanf(fin, "%d%d", &x, &y);
        adauga(x, y);
        adauga(y, x);
    }
    fclose(fin);

    bfs(s, 0);

    FILE *fout = fopen("bfs.out", "w");
    for (i = 1; i <= n; ++i)
        fprintf(fout, "%d ", dist[i]);
    fclose(fout);

    return 0;
}