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

20 votes145 views5 answers
File c++
C++
0 vote141 views1 answer
Apertura file in c++
C++
2 votes147 views2 answers
C++ get cursor position console
C++
0 vote142 views1 answer
How the theam are store in database
C++
1 vote150 views1 answer
In c++ ++ how to write if without if
C++
0 vote181 views2 answers
C++ language
C++
0 vote138 views1 answer
Stl map remove item
C++
1 vote148 views1 answer
Push front vector cpp
C++
1 vote185 views2 answers
Read comma separated text file in c++
C++
5 votes154 views1 answer
Flutter margins
C++