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 vote205 views1 answer
Left margin c++
C++
1 vote204 views1 answer
How to print with the bool value in cpp
C++
1 vote186 views1 answer
Std::queue
C++
1 vote149 views1 answer
How to fill all of the array in c++
C++
0 vote189 views1 answer
Concatenate string along with the size of the word. in c++
C++
1 vote177 views1 answer
String c++ if letter or number
C++
0 vote178 views1 answer
& before function arg in cpp
C++
0 vote175 views1 answer
Alias namespaces c++
C++
0 vote200 views1 answer
How to declare an enum variable c++
C++
1 vote239 views1 answer
Calculate time difference cpp
C++