Cod sursa(job #2171319)

Utilizator Andreea_1009Cimpean Andreea Andreea_1009 Data 15 martie 2018 11:54:46
Problema BFS - Parcurgere in latime Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,s,ma[10005][10005],viz[10005];

void citire_graf(int &n, int &m, int &s, int ma[][10005])
{
    f>>n>>m>>s;
    int x,y;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y;
        ma[x][y]=1;
    }
}

void parcurgere_latime(int s)
{
    int coada[100];
    int prim,ultim;
    viz[s]=0;
    prim=ultim=1;
    coada[prim]=s;
    while(prim<=ultim)
    {
        int nod=coada[prim];
        for(int i=1;i<=n;++i)
        {
            if(ma[nod][i]==1 && viz[i]==-1)
            {
                viz[i]=viz[nod]+1;
                ultim++;
                coada[ultim]=i;
            }
        }
        prim++;
    }

}

int main()
{
    citire_graf(n,m,s,ma);
    for(int i=1;i<=n;++i)
        viz[i]=-1;
    parcurgere_latime(s);
    for(int i=1;i<=n;++i)
        g<<viz[i]<<' ';
    return 0;
}