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 vote148 views2 answers
How can we create 4 digit random number in c++
C++
3 votes123 views2 answers
Convert binary string to int c++
C++
32 votes84 views11 answers
While loop c++
C++
0 vote118 views1 answer
Softwareegg.courses4u
C++
1 vote127 views1 answer
C++ multithreading
C++
2 votes114 views1 answer
Get type of an object c++
C++
0 vote118 views1 answer
Hashset in cpp
C++
5 votes129 views1 answer
Screen record ios simulator
C++
1 vote129 views1 answer
What is _asm in C++
C++
0 vote127 views1 answer
C++ drop last element of list
C++