Cod sursa(job #3263719)

Utilizator dennissaPatrascu Denisa dennissa Data 16 decembrie 2024 11:25:26
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <vector>
#include <fstream>
#define NMAX 100001

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

vector <int > a[NMAX];
int n, start, inc, sf;
int c[NMAX];
int viz[NMAX];
void bfs (int x);
void citire();

int main()
{

    citire();
    bfs(start);
    for(int i=1; i<=n; i++)
    {
        fout<<viz[i]-1<<' ';
    }
    fout.close();
    return 0;
}

void bfs (int x)
{
    int i;
    viz[x]=1;
    c[1]=x;
    inc=sf=1;
    while (inc<=sf)
    {
        x=c[inc++];

        for( i=0; i<a[x].size(); i++)
        {
            if(!viz[a[x][i]])
            {

                viz[a[x][i]]=viz[x];
                c[++sf]=a[x][i];
            }
        }
    }
}

void citire()
{
    int x,y,m;
    fin>>n>>m>>start;
    for(int i=0; i<m; i++)
    {
        fin>>x>>y;
        // intra in lista de adiacenta aaluii a
        a[x].push_back(y);
    }
}