Bfs sudocode

BFS (G, s)                   //Where G is the graph and s is the source node
      let Q be queue.
      Q.enqueue( s ) //Inserting s in queue until all its neighbour vertices are marked.

      mark s as visited.
      while ( Q is not empty)
           //Removing that vertex from queue,whose neighbour will be visited now
           v  =  Q.dequeue( )

          //processing all the neighbours of v  
          for all neighbours w of v in Graph G
               if w is not visited 
                        Q.enqueue( w )             //Stores w in Q to further visit its neighbour
                        mark w as visited.

Source: hackerearth.com

Similar codes

2 votes186 views3 answers
Cpp online compiler
C++
0 vote199 views1 answer
Https://www.google
C++
0 vote186 views1 answer
Intlen in c++
C++
35 votes222 views3 answers
Hello c++
C++
0 vote182 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote201 views1 answer
C++ program to count number of characters of words in a file using stringstream
C++
0 vote200 views1 answer
C++ read each char of string
C++
-1 vote216 views1 answer
I'm still here lyrics
C++
2 votes261 views2 answers
Include cpp
C++
20 votes181 views10 answers
Prime number c++
C++