Cod sursa(job #677565)

Utilizator TeddyBossStefu Teodor Petre TeddyBoss Data 10 februarie 2012 12:35:25
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include<fstream>
#include<iostream>
 using namespace std;
 ifstream in("bfs.in");
	 ofstream out("bfs.out");
int m,n,start,c[100001],viz[100001],li=1,ls,d[1001];
struct nod{
	 int info;
	 nod* next;
};
nod* LA[100001];
void add(int x,int y){
	nod* n=new(nod);
	n->info=y;
	n->next=LA[x];
	LA[x]=n;
}
void citire(){
	in>>n>>m>>start;
	for(int i=1;i<=m;i++){		
	int x,y;	
	in>>x>>y;
	add(x,y);
	}
}

int cvida(){
	return li>ls;
}
void pune(int x){
c[++ls]=x;
}
void scoate(int &x){
	 x=c[li++]; 
}
void bf(int start){
	pune(start);
	viz[start]=1;
	while(!cvida()){
		int x;
		scoate(x);
		nod *nc=LA[x];
		while(nc){
			 int y=nc->info;
			 if(!viz[y]){pune(y);
			 viz[y]=1;
			 d[y]=d[x]+1;
			 }
			 nc=nc->next;}}}

int main (){
	int i;
	citire();
	bf(start);
	for(i=1;i<=n;i++)
		 if(d[i]==0&&i!=start) d[i]=-1;
		 for(i=1;i<=n;i++)
			  out<<d[i]<<" ";
	
	return 0;
}