Breadth First Traversal, with Queue

BFS with Queue

vector<int> adjList[N];
int visited[N];

void bfs(int u)
{
    visited[u] = 1;//mapping the visited nodes, by default 0
    queue<int> nq;//queue used
    nq.push(u);//push initial node
    
    while(!nq.empty())
    {
        int tt = nq.front();
        visited[tt] = 1;
        nq.pop();
        for(int i=0;i<adjList[tt].size();i++)
        {
            if(!visited[adjList[tt][i]])
            {
                nq.push(adjList[tt][i]);//push all non-visited neighbours
            }
        }
        
    }
}