Cod sursa(job #1378083)

Utilizator onica.alexandraOnica Ioana-Alexandra onica.alexandra Data 6 martie 2015 10:28:49
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
using namespace std;
int a[20][20];
int c[20],v[20];
int i,n,el,pl,j,m,x,y,p,u;
int main()
{
    cout<<"nr noduri=";cin>>n;
    cout<<"nr muchii=";cin>>m;
    for(i=1;i<=m;i++)
    {
        cout<<"x=";
        cin>>x;
        cout<<"y=";cin>>y;
        a[x][y]=1;
        a[y][x]=1;
    }
    //for(i=1;i<=n;i++)
    //viz[i]=0;
    cout<<"nodulde plecare=";
    cin>>pl;
    v[pl]=1;
    p=1;
    c[1]=pl;
    u=1;
    while(p<=u)
    {
        el=c[p];
        for(j=1;j<=n;j++)
        if(a[el][j]==1&&v[j]==0)
        {
            u++;
            c[u]=j;
            v[j]=1;
        }
        p++;
    }
    for(i=1;i<=u;i++)
cout<<c[i]<<" ";
return 0;
}