#include <iostream>
#include <queue>

using namespace std;

const int MAXN = 100;   // maximum number of vertices in the graph

void bfs(int adj_list[MAXN][MAXN], int n, int start) {
    bool visited[MAXN] = {false};   // keep track of visited vertices
    queue<int> q;   // initialize a queue for BFS

    visited[start] = true;
    q.push(start);

    while(!q.empty()) {
        int curr_vertex = q.front();
        q.pop();

        // process the current vertex
        cout << curr_vertex << " ";

        // visit all the neighbors of the current vertex
        for(int i=0; i<n; i++) {
            if(adj_list[curr_vertex][i] && !visited[i]) {
                visited[i] = true;
                q.push(i);
            }
        }
    }
}

int main() {
    int adj_list[MAXN][MAXN] = {{0, 1, 1, 0, 1, 0}, {1, 0, 1, 0, 0, 0}, {1, 1, 0, 1, 1, 1}, {0, 1, 1, 0, 0, 0}};
    int num_vertices = 6;
    int start_vertex = 0;
    bfs(adj_list, num_vertices, start_vertex);
    return 0;
}