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 vote112 views1 answer
Return array of string in function c++
C++
6 votes105 views1 answer
Should i learn c or c++
C++
0 vote119 views1 answer
Sfml time set
C++
2 votes105 views1 answer
Dlopen failed: library "libomp.so" not found
C++
3 votes105 views5 answers
Round double to 2 decimal places c++
C++
1 vote107 views1 answer
Save all output in log file c cpp
C++
84 votes182 views4 answers
Php string
C++
0 vote115 views1 answer
Cpp loop through object
C++
0 vote116 views2 answers
Is the c++ 20 char te same as the old one
C++
0 vote116 views1 answer
Quicksort taking random pivot
C++