Cod sursa(job #1376392)

Utilizator HothazieHothazie Vlad Hothazie Data 5 martie 2015 17:16:19
Problema BFS - Parcurgere in latime Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>

using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int i,j,n,m,x,y,s,u,p,c[1000],et[1000],a[1000][1000];
void afis()
{
    for(i=1;i<=n;i++)
        g<<et[i]-1<<" ";
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][y]=1;
    }
    c[1]=s;
    et[s]=1;
    p=u=1;
    while(p<=u)
    {
        x=c[p];
        for(i=1;i<=n;i++)
           {
            if(et[i]==0 && a[x][i]==1)
                {

                et[i]=et[x]+1;
                u++;
                c[u]=i;
                }


           }
        p++;
    }
    afis();
    return 0;
}