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 vote236 views1 answer
String interpolation in c++
C++
15 votes230 views10 answers
Hello world
C++
1 vote217 views1 answer
C++ ::
C++
0 vote235 views2 answers
Basic Makefile C++
C++
0 vote223 views1 answer
How to allocate memory for vector c++
C++
5 votes224 views1 answer
Best clips recording software for cs go
C++
1 vote295 views1 answer
How to iterate throguh a string in c++
C++
0 vote285 views2 answers
. Shell sort in c++
C++
0 vote262 views1 answer
Lru cache gfg
C++
2 votes246 views2 answers
Cannot open include file:
C++