Cod sursa(job #957958)

Utilizator lica.iosifLica Iosif lica.iosif Data 6 iunie 2013 17:29:56
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
using namespace std;
long a[4000][4000],q[4000],t[4000],lg[4000],p,u,nod,n,m,s;
bool sel[4000];
ifstream f("bfs.in");
ofstream g("bfs.out");
void bf(int x)
{
    long i;
    sel[x]=true;q[1]=x;t[x]=0;lg[x]=0;p=u=1;
    while(p<=u)
        {
             nod=q[p];
             for(i=1;i<=n;i++)
                if(a[nod][i]&&!sel[i])
                {
                    q[++u]=i;
                    t[i]=nod;sel[i]=true;
                    lg[i]=lg[nod]+1;
                }
            p++;
        }
    for(i=1;i<=n;i++) if(!sel[i]) lg[i]=-1;
}
int main()
{
    long x,y,i;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
        {
            f>>x>>y;
            a[x][y]=1;
        }
    bf(s);
    for(i=1;i<=n;i++)
        cout<<lg[i]<<" ";
}