1.md

BFS Traversal of Graph

vector<int> bfsOfGraph(int V, vector<int> adj[]) {
        // Code here
        
        int visited[V]={0};
        visited[0]=1;
        
        vector<int> ans;
        queue<int>q;
        
        q.push(0);
        
        while(!q.empty())
        {
            int node=q.front();
            q.pop();
            
            ans.push_back(node);
            
            for(auto it : adj[node])
            {
                if(visited[it]==0)
                {
                    q.push(it);
                    visited[it]=1;
                }
            }
        }
        return ans;
    }