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

66 votes351 views8 answers
Dogecoin price
C++
20 votes263 views2 answers
Find height of a tree
C++
0 vote277 views1 answer
Qt graphics scene map cursor position
C++
0 vote277 views1 answer
Temperature conversion in c++
C++
3 votes278 views2 answers
Friend class c++
C++
0 vote273 views1 answer
Hello world in c/++
C++
0 vote256 views1 answer
C++ fstream create if not exists
C++
0 vote307 views1 answer
How to run cpp using gcc vscode
C++
2 votes278 views1 answer
Retu7rn this c++
C++
1 vote268 views1 answer
Qimage transformed
C++