stack< int > s1;
s1.push ( source) ;
while ( ! s1.empty ( ) )
{
x= s1.top ( ) ;
cout << x<< endl;
s1.pop ( ) ;
arra[ x] = 1 ; // array is for visited purpose and is intitalized 0 before
for ( i = 1 ; i <= 5 ; ++ i)
{
if ( arr[ x] [ i] == 1 && arra[ i] ! = 1 ) { // array is for adjacency matrix
s1.push ( i) ;
//cout<<i<<"f"<<endl;
}
}
}
c3RhY2s8aW50PnMxOwogICAgczEucHVzaChzb3VyY2UpOwogICAgd2hpbGUoIXMxLmVtcHR5KCkpCiAgICB7CiAgICAgICAgeD1zMS50b3AoKTsKICAgICAgICBjb3V0PDx4PDxlbmRsOwogICAgICAgIHMxLnBvcCgpOwogICAgICAgIGFycmFbeF0gPSAxOyAgIC8vIGFycmF5IGlzIGZvciB2aXNpdGVkIHB1cnBvc2UgYW5kIGlzIGludGl0YWxpemVkIDAgYmVmb3JlCiAgICAgICAgZm9yKGkgPSAxO2kgPD0gNTsrK2kpCiAgICAgICAgewogICAgICAgICAgICBpZihhcnJbeF1baV0gPT0gMSYmYXJyYVtpXSAhPSAxKXsgICAgICAgICAvLyBhcnJheSBpcyBmb3IgYWRqYWNlbmN5IG1hdHJpeAogICAgICAgICAgICAgICAgczEucHVzaChpKTsKICAgICAgICAgICAgICAgIC8vY291dDw8aTw8ImYiPDxlbmRsOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQ==