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 vote168 views1 answer
Pow without math.h
C++
1 vote187 views1 answer
C++ check if cin didn't get int
C++
2 votes184 views2 answers
Stack algorithm in c++
C++
0 vote274 views2 answers
\0 in c++
C++
8 votes166 views2 answers
Check variable type c++
C++
4 votes164 views2 answers
C++ inline if
C++
2 votes162 views1 answer
Allocation an array with new cpp
C++
0 vote177 views1 answer
C++ find minimum value in vector
C++
2 votes169 views2 answers
Cpp split string by space
C++
2 votes223 views1 answer
C++ how to loop through a vector but not the last element
C++