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 vote259 views1 answer
Call by value in c++
C++
0 vote244 views1 answer
How to make a typing effect c++
C++
0 vote256 views1 answer
At c++ vector
C++
0 vote235 views1 answer
Who made c++
C++
2 votes246 views1 answer
Retu7rn this c++
C++
0 vote254 views1 answer
Mpgh dbd
C++
0 vote268 views1 answer
Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum
C++
0 vote246 views1 answer
C++ start thread later
C++
104 votes345 views6 answers
Convert int to string c++
C++
2 votes250 views5 answers
C++ loop through array
C++