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

1 vote206 views1 answer
C++ product of vector
C++
0 vote210 views1 answer
How to loop through a set of pairs in c++
C++
4 votes200 views1 answer
How to make i/o fast in c++
C++
5 votes206 views1 answer
Qdebug
C++
0 vote231 views1 answer
Stl reverse sort a array
C++
0 vote210 views1 answer
Insertion overloading in c++
C++
2 votes206 views1 answer
Suppress individual warnings in visual c++
C++
1 vote215 views1 answer
Vector erase not working c++
C++
0 vote205 views1 answer
Error uploading arduino code
C++
0 vote223 views1 answer
Cpp get keystroke in console only
C++