Cod sursa(job #393208)

Utilizator preda_alexandruPreda Alexandru preda_alexandru Data 9 februarie 2010 02:17:58
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include<fstream.h>
#include<iostream.h>
int a[20001][20001],sel[20001],c[20001];
int main()
{
int n,m,s,li,ls,i,k,j=0;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
fin>>n>>m>>s;
for(i=1;i<=m;i++){
				 fin>>li>>ls;
				 a[li][ls]=1;
				 }
c[1]=s;
for(i=1;i<=n;i++)sel[i]=-1;
sel[s]=0;
li=1;
ls=1;
while(li<=ls){
			 k=0;
			 for(i=1;i<=n;i++)if(a[c[li]][i] && sel[i]==-1)
											 {
											 if(!k)j++;
											 k=1;
											 sel[i]=j;
											 c[++ls]=i;
											 }
			 li++;
			 }
for(i=1;i<=n;i++)fout<<sel[i]<<' ';
return 0;
}