///Parcurgerea grafurilor in latime Breadth First Search (BFS)
#include<fstream>
#include<iostream>
using namespace std;
int a[10][10],c[20],viz[10];
int n,prim,ultim,varf;
void citire()
{
    int x,y;
    ifstream fin("muchii.txt");
    fin>>n;
    while(fin>>x>>y)
        a[x][y]=1; ///a[x][y]=a[y][x]=1;
}
void bf() //parcurgerea in latime
{
    int k;
    while(prim<=ultim)
    {
        varf=c[prim];
        for(k=1; k<=n; k++)
            if(a[varf][k]==1&&viz[k]==0) ///if(a[nod][k]*a[k][nod]==1&&viz[k]==0)    
		///este vecin pt. varf si ne-vizitat
            {
                ultim++;
                c[ultim]=k;
                viz[k]=1;
            }
        prim++;
    }
}
int main()
{
    int i, nd;
    citire();
    afisare();
    prim=ultim=1;
    cin>>nd;  /// varful  de la care se porneste parcurgerea
    viz[nd]=1;
    c[prim]=nd;
    bf();
    for(i=1; i<=ultim; i++) ///afisarea
        cout<<c[i]<<" ";
    return 0;
}

#include<fstream>
#include<iostream>
using namespace std;
int a[20][20],n,m,viz[100],gasit,d[20],r;
void df(int nod)
{
    cout<<nod<<" ";
    d[r++]=nod;
    viz[nod]=1;
    for(int k=1; k<=n; k++)         
        if(a[nod][k]==1&&viz[k]==0)    /// if(a[nod][k]*a[k][nod]==1&&viz[k]==0)          
        df(k);
}
int main()
{
    int x,y,i,j,nd;
    ifstream f("graf.txt");
     f>>n;
    while(f>>x>>y)         
        a[x][y]=1; /// a[x][y]=a[y][x]=1;
    cin>>nd;
    df(nd);
    for(i=1; i<=r; i++) ///afisarea 
        cout<<d[i]<<" ";
    return 0;
}