Cod sursa(job #833298)

Utilizator krissu93FMI Tiugan Cristiana Elena krissu93 Data 12 decembrie 2012 11:17:04
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector <int> vec[100009];
int viz[100009];
int coada[100009];
int n,m,s;

void citeste()
{	int a,b;
	in>>n>>m>>s;
	int i;
	for (i=1;i<=m;i++)
	{
		in>>a>>b;
		vec[a].push_back(b);
	}
}
void actualizeaza()
{
	int i;
	for (i=1;i<=n;i++)
		viz[i]=0;
}

int main()
{
	citeste();
	actualizeaza();
int i,u,p;
	u=1;
	coada[u]=s;
	viz[s]=1;
	p=0;
	while(p<u)
	{	p++;
		for(i=0;i<vec[coada[p]].size();i++)
			if( !viz[vec[coada[p]][i]] )
			{	viz[vec[coada[p]][i]]=viz[coada[p]]+1;
				coada[++u]=vec[coada[p]][i];
			}
	}
	for (int i=1;i<=n;i++)
		out<<viz[i]-1<<' ';
	return 0;
}