LEE liniar

#include <iostream>
#include <fstream>
using namespace std;

ifstream f("leeliniar.in");

int a[100][100],d[100],c[100],n,start,u,p;
bool viz[100];

void citire()
{
    int i,j;
    f>>n>>start;
    while(f>>i>>j)
        a[i][j]=a[j][i]=1;
}

void LEE_liniar()
{
    p=u=1;
    int i,x;
    c[1]=start;
    viz[start]=true;
    d[start]=0;
    while(p<=u)
    {
        x=c[p];
        for(i=1; i<=n; i++)
            if(a[i][x]&&!viz[i])
            {
                viz[i]=true;
                u++;
                c[u]=i;
                d[i]=d[x]+1;
            }
        p++;
    }
}

int main()
{
    citire();
    LEE_liniar();
    for(int i=1; i<=n; i++)
        if(i!=start)
            cout<<"Drumul de la "<<start<<" pana la "<<i<<" = "<<d[i]<<endl;
    cout<<endl<<"Nodurile in parcurere BF: ";
    for(int i=1; i<=u; i++)
        cout<<c[i]<<" ";
}
/*
6
4
1 4
1 3
2 4
3 4
3 5
5 6
*/