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

5 votes170 views2 answers
String c++ if letter is lowercase
C++
0 vote263 views1 answer
Rc.local not running centos 6
C++
0 vote170 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
0 vote185 views1 answer
Compute the average of an array c++
C++
1 vote184 views1 answer
What is difffrence between s.length() and s.size()
C++
0 vote174 views1 answer
Contoh space
C++
1 vote159 views3 answers
How to get a random number between two numbers in c++
C++
7 votes176 views2 answers
Round c++
C++
0 vote190 views1 answer
Find a number in vector c++
C++
2 votes162 views1 answer
Clrscr in cpp
C++