Cod sursa(job #789310)

Utilizator akumariaPatrascanu Andra-Maria akumaria Data 17 septembrie 2012 19:55:10
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<stdio.h>
#include<vector>
#include<queue>

using namespace std;

int viz[100005];
queue<int>q;
vector<int>a[100005];



int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	int n,m,s,x,y,i;
	scanf("%d%d%d",&n,&m,&s);
	for(i=1;i<=m;++i)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	q.push(s);
	viz[s]=1;
	while(!q.empty())
	{
		s=q.front();
		y=a[s].size();
		for(i=0;i<y;++i)
			if(!viz[a[s][i]])
			{
				viz[a[s][i]]=viz[s]+1;
				q.push(a[s][i]);
			}
		q.pop();
	}
	for(i=1;i<=n;++i)
		printf("%d ",viz[i]-1);
	return 0;
}