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

1 vote468 views1 answer
C++ vector structure
C++
3 votes141 views1 answer
C++ check if string contains uppercase
C++
1 vote138 views1 answer
C++ for loop multiple variables
C++
1 vote142 views1 answer
C++ copy file to another directory
C++
21 votes202 views3 answers
C++ access second last element of vector
C++
0 vote220 views5 answers
Palindrome String
C++
0 vote151 views1 answer
C++ first index 0 or 1
C++
7 votes104 views2 answers
Initialization list c++
C++
0 vote138 views1 answer
Temporary mobile number
C++
2 votes144 views1 answer
Insert element in array c++
C++