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 vote116 views1 answer
How to concatenate two vectors in c++
C++
1 vote118 views1 answer
How to delete an element in vector pair in cpp
C++
10 votes67 views2 answers
Last index of string c++
C++
1 vote149 views1 answer
Factore of 20 in c+
C++
0 vote116 views1 answer
Int a=0; int b=30;
C++
0 vote159 views6 answers
Std::string(size_t , char ) constructor:
C++
0 vote72 views1 answer
Check if char are equal c++
C++
7 votes113 views5 answers
Set precision in c++
C++
0 vote78 views1 answer
Get data from a content editable div
C++
1 vote114 views1 answer
Enumerate with letters latex
C++