Cod sursa(job #2784724)

Utilizator Tache_RoxanaTache Roxana Tache_Roxana Data 17 octombrie 2021 09:54:19
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>
//#include <vector>
using namespace std;

int coada[100], st = 1, dr = 1, vizitati[100];
int vizitat(int x) {
    int ok = 0, i = st;
    while(ok == 0 && i <= dr){
        if(vizitati[i] == x)
            ok = 1;
        i++;
    }
    return ok;
}

int main()
{
    int n, m, s;
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in >> n >> m >> s;
    int a[n][n];
    for(int i = 1; i <= m; i++){
        int x, y;
        in >> x >> y;
        a[x][y] = a[y][x] = 1;
    }
    coada[st] = s;
    vizitati[st] = s;
    dr++;
    while(st != dr) {
        for(int i = 1; i <= n; i++) {
            if(a[coada[st]][i] != 0 && vizitat(i) == 0){
                cout << i << " ";
                vizitati[dr] = i;
                coada[dr] = i;
                dr++;
            }
        }
        st++;
    }
    return 0;
}