Cod sursa(job #1356090)

Utilizator bianncaPoenar Bianca biannca Data 23 februarie 2015 10:33:17
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int main()
{
	long n,m,s,i,st,dr,x,y;
	long a[10000][10000],p[10000],d[10000],v[10000];
	fin>>n>>m>>s;
	for(i=1;i<=m;i++)
	{
		fin>>x>>y;
		a[x][y]=1;
		a[y][x]=1;
	}
	
	 st=1; dr=1; v[1]=s; p[s]=1; d[s]=0;
		while(st<=dr)
		{
			for(i=1;i<=n;i++)
			if(a[v[st]][i]==1 && p[i]==0)
			{
				dr++;
				v[dr]=i;
				p[i]=1;
				d[i]=d[v[st]]+1;
			}
			st++;
		}
	
	for(i=1;i<=n;i++)
		if(d[i]!=0)
			fout<<d[i]<<" ";
		else fout<<"-"<<" ";
	//system("pause");
		return 0;
}