Cod sursa(job #651359)

Utilizator PetroiuDorinPetroiu Dorin ALexandru PetroiuDorin Data 20 decembrie 2011 09:26:35
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include<iostream.h>
#include<fstream.h>
int viz[10],a[10][10],s[10],n,m;
void citiregraf(){ifstream f("graf.in"); int i,j;
			f>>n;
			while(f>>i>>j){a[i][j]=a[j][i]=1;}
			f.close();}
void main(){int x,is,i,j;
	    cout<<"dati nodul de pornire"; cin>>x;
	    viz[x]=1;is=1;s[is]=x;
	    citiregraf();
	    while(is>0){for(i=1;i<=n;i++)
			if((a[i][s[is]]==1)&&(viz[i]==0))
			  {is++;s[is]<i;viz[i]=1; cout<<i<<" ";}
			  is--;}}