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 vote199 views6 answers
Wine linux
C++
1 vote221 views1 answer
Select one random element of a vector in c++
C++
0 vote218 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
1 vote237 views1 answer
Every number is coming thrice except one
C++
20 votes245 views4 answers
Stoi in c++
C++
5 votes185 views3 answers
Int to float c++
C++
1 vote180 views1 answer
How to reset linerenderer unity
C++
1 vote204 views1 answer
3d projection onto 2d plane algorithm
C++
0 vote221 views1 answer
Inner Section Sticky Scroll in elementor
C++
0 vote170 views1 answer
C plus plus hello world
C++