Cod sursa(job #1043548)

Utilizator vladc096Vlad Cincean vladc096 Data 28 noiembrie 2013 18:44:54
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>

int n, m, s, c[10000], vis[10000], mat[10000][10000], p, u, v, x, y, k[10000];

using namespace std;

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        mat[x][y]=1;
    }
    c[1]=s;
    vis[s]=1;
    p=u=1;
    for(int i=1; i<=n; i++) k[i]=-1;
    k[s]=0;
    while(p<=u)
    {
        v=c[p]; p++;
        for(int i=1; i<=n; i++)
            if(mat[v][i]==1 && vis[i]==0)
            {
                u++;
                c[u]=i;
                vis[i]=1;
                k[i]=k[v]+1;
            }
    }
    for(int i=1; i<=n; i++) out<<k[i]<<" ";

}