Cod sursa(job #1392513)

Utilizator BlackMWStefan Laurentiu BlackMW Data 18 martie 2015 18:24:05
Problema BFS - Parcurgere in latime Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,C[142],viz[142],prim,ultim,p,v[142][142],x,y;
void citire()
{f>>n>>m>>s;
 for(int i=1;i<=m;i++)
    {f>>x>>y;
     v[x][y]=1;
    }
}
void bfs()
{
 C[1]=s;prim=ultim=1;viz[s]=1;
 while(prim<=ultim)
    {p=C[prim++];
     for(int i=1;i<=n;i++)
        if(v[p][i]==1&&viz[i]==0){C[++ultim]=i;viz[i]=viz[p]+1;}
    }
}
int main()
{
    citire();
    bfs();
    for(int i=1;i<=n;i++)g<<viz[i]-1<<" ";
    return 0;
}