Cod sursa(job #2889292)

Utilizator MariusANDMarius-Ionut Andreiasi MariusAND Data 12 aprilie 2022 16:10:50
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int m,n,a[1001][1001],viz[1001],dist[1001],coada[1001];
void BFS(int start)
{
	int i,k,st=1,dr=1;
	viz[start]=1;
	coada[st]=start;
	while(st<=dr)
	{
		k=coada[st];
		for(i=1; i<=n; i++)
			if(a[k][i]==1 && viz[i]==0)
			{
				viz[i]=1;
				dr++;
				coada[dr]=i;
				dist[i]=dist[k]+1;
			}
		st++;
	}
	for(i=1; i<=n; i++)
		if(dist[i]==0 && i!=start)
			g<<-1<<" ";
		else if(i==start)
			g<<0<<" ";
		else g<<dist[i]<<" ";
}

int main()
{
	int x,y,start;
	f>>n>>m>>start;
	for(int i=1; i<=m; i++)
	{
		f>>x>>y;
		a[x][y]=1;
	}
	BFS(start);
}