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

0 vote142 views1 answer
Opengl draw cresent moon c++
C++
3 votes138 views1 answer
Initialize dynamic array c++ to 0
C++
1 vote134 views1 answer
Print std map
C++
6 votes130 views1 answer
C++ estimate deciimal to a point
C++
0 vote141 views1 answer
Directed graph in cpp
C++
0 vote138 views1 answer
C++ get type name of object
C++
22 votes133 views4 answers
Height of the tree
C++
0 vote143 views1 answer
Sort html elements in Jquery on condition
C++
0 vote151 views1 answer
Exit: redefinition; '__declspec(noreturn)' or '[[noreturn]]'
C++
1 vote166 views1 answer
C++ cout format
C++