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 vote171 views1 answer
Cod Cold War no recoil
C++
1 vote185 views2 answers
C++ function as paramter
C++
0 vote280 views1 answer
Const char * to std::wstring
C++
12 votes243 views2 answers
How can I convert a string in char in c++?
C++
0 vote243 views1 answer
Operand-- c++
C++
0 vote204 views1 answer
How to calculate bitwise xor c++
C++
0 vote205 views1 answer
Print duplicate characters from string in c++
C++
3 votes192 views3 answers
C++ class
C++
8 votes195 views4 answers
C++ max and min of vector
C++
1 vote197 views1 answer
How to return 2d array from function c++
C++