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 vote327 views1 answer
The number of ones int bitset
C++
7 votes307 views2 answers
C++ threads
C++
19 votes324 views6 answers
Rand() c++
C++
7 votes327 views1 answer
Vector concat c++
C++
8 votes364 views1 answer
Remove last letter in string c++
C++
0 vote310 views1 answer
Equals operator c++ overlaod
C++
0 vote323 views1 answer
C++ move second line
C++
1 vote386 views1 answer
Factore of 20 in c+
C++
0 vote356 views1 answer
Qt file explorer
C++
0 vote306 views1 answer
Input full line as input in cpp
C++