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

10 votes180 views2 answers
C++ function inside main
C++
0 vote156 views7 answers
C++ convert to c online
C++
0 vote161 views1 answer
C++ read_ascii
C++
1 vote181 views1 answer
Int main() {
C++
0 vote158 views1 answer
Run c++ program in mac terminal
C++
0 vote179 views1 answer
Initialize 2d array c++ memset
C++
0 vote161 views1 answer
Arduino jumper programmieren
C++
0 vote172 views1 answer
Stringstream stream number to string
C++
0 vote192 views1 answer
C++ caps lock key
C++
6 votes192 views2 answers
Find permutations
C++