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 vote91 views1 answer
Cicli informatica c++
C++
11 votes97 views3 answers
C++ map iterator
C++
29 votes191 views6 answers
Convert string to number c++
C++
0 vote100 views1 answer
My cpp
C++
0 vote98 views1 answer
How to move your chrector in unity
C++
0 vote104 views2 answers
C++ convert vector of digits into integer
C++
9 votes117 views4 answers
Print vector c++
C++
0 vote109 views1 answer
Binpow in fenwick tree
C++
0 vote108 views1 answer
How to define global array in c++ in a scope
C++
0 vote111 views1 answer
Calculate if year is leap year
C++