Cod sursa(job #393584)

Utilizator unknownliviuMaria Liviu Valentin unknownliviu Data 9 februarie 2010 18:15:39
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include<cstdio>
#include<vector>
using namespace std;
const int N=100000;
vector<int> a[N];
int n,s,m;
void read()
{
	freopen("bfs.in","r",stdin);
	int x,y;
	scanf("%d%d%d", &n ,&m ,&s);
	while(m--)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
}
int d[N]={-1},c[N];
char viz[N];
//int pred[N]; nu il apelez nicaieri
void bfs(int x)
{
	int y,p=0,u=0;
	c[1]=x;
	d[x]=0;
	//pred[x]=0;
	while(p<=u)//coada nevida
	{
		//tai pe x din coada
		for(int i=0;i<a[x].size();i++)
		{
			y=a[x][i];
			if(!viz[y])//nevizitat
			{
				u++;
				c[u]=y;
				viz[y]=1;
			}
			d[y]=1+d[x];
		//	pred[y]=x;
		}
		p++;
	}
}
int main()
{
	freopen("bfs.out","w",stdout);
	read();
	bfs(s);
	for(int i=1;i<=n;i++)
		printf("%d ",d[i]);
	return 0;
}