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 vote305 views1 answer
C++ print 3d cube
C++
0 vote299 views1 answer
C++ conditional typedef
C++
14 votes267 views6 answers
How to get size of array c++
C++
12 votes339 views4 answers
How to initialized a 2d vector
C++
0 vote314 views1 answer
How to choose struct's endianness cpp
C++
1 vote289 views3 answers
C++ map loop through key value
C++
0 vote338 views2 answers
Convert hex to decimal arduino
C++
0 vote305 views1 answer
How to add numbers in c++
C++
1 vote304 views1 answer
Vector with pinter cout c++
C++
0 vote274 views1 answer
Number of nodes of bst cpp
C++