Cod sursa(job #1948149)

Utilizator cris90robert@yahoo.comseretan cristian [email protected] Data 31 martie 2017 19:17:53
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
	long long  m,n,i,j,viz[10000]={},v[10000]={},u,coada[10000],a[100][100]={};
	int s,k;
	fstream f("bfs.in",ios::in);
	f>>n>>m>>s;
	for(i=1;i<=m;i++)
	{
		f>>j>>k;
		a[j][k]=1;
	}
	f.close();
	u=1;
	coada[u]=s;
	i=1;
	viz[s]=1;
	while(p<=u)
	{
		k=coada[i];
		for(j=1;j<=n;j++)
		{
			if((viz[j]==0)&&(a[k][j]==1))
			{
				v[j]=v[k]+1;
				viz[j]=1;
				u++;
				coada[u]=j;
			}
		}
		i++;
	}
	fstream g("bfs.out",ios::out);
	for(i=1;i<=n;i++)
	{
		if(v[i]==0)
		{
			if(i==s)
			{
				g<<"0 ";
			}
			else
			{
				g<<"-1 ";
			}
		}
		else
		{
			g<<v[i]<<" ";
		}
	}
	g.close();
}