Cod sursa(job #676773)

Utilizator sebe14Moraru Sebastian sebe14 Data 9 februarie 2012 16:24:17
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include<fstream>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

int n,m,v[100001],c[100001],li=1,ls,d[100001],start;

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(){
	int i,x,y;
	in>>n>>m>>start;
	for(i=1; i<=m; i++){
		in>>x>>y;
		add(x,y);
	}
}

void pune(int x){
	ls++;
	c[ls]=x;
}

void scoate(int &x){
	x=c[li];
	li++;
}

int coada_vida(){
	if(li>ls)
		return 1;
	return 0;
}

void bf(int start){
	v[start]=1;
	pune(start);
	while(!coada_vida()){
		int x;
		scoate(x);
		nod *nc=la[x];
		while(nc){
			int y=nc->info;
			if(!v[y]){
				v[y]=1;
				pune(y);
				d[y]=d[x]+1;
			}
			nc=nc->next;
		}
		
	}
}

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