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 vote102 views1 answer
Windows install cppcheck
C++
6 votes87 views2 answers
C++ create thread
C++
1 vote95 views3 answers
If else c++
C++
0 vote103 views1 answer
C++ if else if
C++
2 votes103 views1 answer
Find character in string c++
C++
0 vote92 views1 answer
Google test assert stdout
C++
5 votes116 views3 answers
C++ remove space from string
C++
-1 vote98 views1 answer
Easy c++ code
C++
0 vote89 views1 answer
System("pause") note working c++
C++
0 vote148 views1 answer
Strring length in c++
C++