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 vote184 views1 answer
Life the universe and everything solution c++
C++
1 vote185 views1 answer
How to print fixed places after decimal point in c++
C++
3 votes203 views2 answers
Iomanip
C++
2 votes239 views1 answer
Cin.tie c++
C++
0 vote248 views1 answer
Curl upload folder and subfolders
C++
1 vote182 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
0 vote184 views1 answer
Entering char in int c++ avoid loop
C++
66 votes247 views8 answers
Dogecoin price
C++
20 votes211 views1 answer
Flutter convert datetime in day of month
C++
1 vote587 views1 answer
C++ vector structure
C++