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 vote157 views1 answer
Declaring array of int
C++
9 votes178 views3 answers
C++ find element in vector
C++
1 vote116 views1 answer
Can we create array inside an array in c++
C++
-2 votes175 views1 answer
Sum array c++
C++
2 votes167 views2 answers
How to get cursor position c++
C++
12 votes168 views3 answers
C++ vector size
C++
0 vote171 views2 answers
C++ 14 for sublime windoes build system
C++
7 votes166 views1 answer
Appending a vector to a vector in C++
C++
0 vote169 views1 answer
How to block the screen c++
C++
0 vote190 views1 answer
C++ find minimum value in vector
C++