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 vote243 views1 answer
C++ localtime unsafe
C++
0 vote239 views2 answers
C++ 14 for sublime windoes build system
C++
0 vote212 views1 answer
Print value of data in c++
C++
0 vote221 views1 answer
400 watt hour per kg
C++
1 vote208 views1 answer
System cpp
C++
0 vote240 views1 answer
Opencv rgb to gray c++
C++
0 vote280 views1 answer
BMI Calculator Program in C++
C++
1 vote230 views1 answer
Tarray ue4 c++
C++
0 vote211 views1 answer
Array di struct
C++
0 vote263 views1 answer
Concatenate two vectors c++
C++