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

2 votes351 views2 answers
Resize two dimensional vector c++
C++
3 votes349 views1 answer
Differentialble programming
C++
11 votes354 views2 answers
Str remove char c++
C++
-1 vote331 views1 answer
String interpolation in c++
C++
0 vote337 views4 answers
How to modify 2d array in function c++
C++
1 vote349 views1 answer
Qstring insert character
C++
32 votes358 views2 answers
How to sort a vector in reverse c++
C++
0 vote371 views1 answer
Cpp pointer to two dimensional array
C++
2 votes310 views1 answer
Allocation an array with new cpp
C++
1 vote401 views3 answers
Arduino get size of array
C++