BFS.cpp

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

void BFS(int vtx,int a[][8],int n){
    queue<int> Q;
    int visited[8] {0};
    
    cout<<vtx<<" ,";
    visited[vtx] = 1;
    Q.emplace(vtx);
    
    while(!Q.empty()){
        int u = Q.front();
        Q.pop();
        for(int v=1;v<=n;v++){
            if(a[u][v] == 1 && visited[v]==0){
                cout<<v<<" ,";
                visited[v]=1;
                Q.emplace(v);
            }
        }
    }
    cout<<"\n";
}

int main(){
    int A[8][8] = {{0, 0, 0, 0, 0, 0, 0, 0},
                   {0, 0, 1, 1, 1, 0, 0, 0},
                   {0, 1, 0, 1, 0, 0, 0, 0},
                   {0, 1, 1, 0, 1, 1, 0, 0},
                   {0, 1, 0, 1, 0, 1, 0, 0},
                   {0, 0, 0, 1, 1, 0, 1, 1},
                   {0, 0, 0, 0, 0, 1, 0, 0},
                   {0, 0, 0, 0, 0, 1, 0, 0}};
                   
    cout<<"Vertex 1: -> ";
    BFS(1,A,8);
    
    cout<<"Vertex 2: -> ";
    BFS(2,A,8);
    
    return 0;
}