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 vote132 views1 answer
Bit++ codeforces in c++
C++
0 vote142 views1 answer
Https://www.google
C++
0 vote123 views1 answer
PCL RANSAC
C++
-1 vote122 views1 answer
Helloworld in c++
C++
0 vote141 views1 answer
Faster solutions
C++
-3 votes151 views2 answers
Virtual function in C++
C++
0 vote124 views1 answer
How to input a vector when size is unknown
C++
0 vote144 views1 answer
"++i + ++i" explanation
C++
0 vote130 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
0 vote126 views1 answer
Cuda locks
C++