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 vote130 views1 answer
Regex for phone number c++
C++
0 vote132 views1 answer
How to create a custom event in ue4 c++
C++
0 vote134 views1 answer
Rectangle Area hackerrank in c++
C++
0 vote130 views1 answer
Std::iomanip c++
C++
8 votes173 views10 answers
Javascript loop array
C++
0 vote133 views1 answer
Print all even number using for loop c++
C++
0 vote135 views1 answer
Split the array there is an array val of n integers . A good subarray is defined as
C++
2 votes143 views1 answer
Unity failed to load window layout
C++
5 votes144 views1 answer
C++ is string a number
C++
111 votes304 views6 answers
Convert integer to string c++
C++