The BFS algorithm implemented using std::list

bfs_list.cpp

//list is basically a linked-list
int bfs_list(Graph* g){
  int sig=0;
  vector<bool> visited(g->getSize(), false);
  list<int> q; 
  auto init = rand()%g->getSize();
  q.push_back(init);
  visited[init]=true;
  while(!q.empty()){
    auto u = q.front(); 
    sig += u;
    q.pop_front();
    for(auto v: g->adj_list[u]){
      if(!visited[v]){
        visited[v]=true;
        q.push_back(v);
      }
    }
  }
  return sig;
}