a bfs implementation using cpp

bfs.cpp

#include <iostream>
#include <queue>
#include <vector>
#include <string.h>

vector<vector<int> > graph;

void bfs(int src){
  
  bool visited[1000];
  memset(visited, false, sizeof(visited));
  queue<int> q;
  q.push(src);
  
  visited[src] = true;
  
  while(!q.empty()){
    
    int n = q.front(); q.pop();
    for(auto it: graph[n]){
      
      if(visited[it]) continue;
      visited[it] = true;
      q.push(it);
      
    }
  
  }

}

int main(){
//1-fill vector graph
//2- call bfs (src node)
  
return 0;
}