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 vote309 views1 answer
Cout stack in c++
C++
0 vote294 views1 answer
Why return 0 in int main
C++
0 vote283 views1 answer
C++ include a file in another directory
C++
0 vote323 views1 answer
Lcm function c++
C++
0 vote344 views1 answer
Inverse lerp c++
C++
0 vote291 views1 answer
Pascal's triangle in c++ through pointer
C++
0 vote327 views1 answer
Google test assert exception
C++
22 votes317 views2 answers
DateFormat in Flutter
C++
0 vote273 views1 answer
C++ create a vecto
C++
0 vote288 views1 answer
Qt widget list set selected
C++