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 vote425 views1 answer
C++ with SVD
C++
1 vote337 views1 answer
Get a string from file in c++
C++
0 vote326 views3 answers
If
C++
1 vote331 views1 answer
C++ print vector without loop
C++
1 vote336 views1 answer
Copy a part of a vector in another in c++
C++
3 votes354 views4 answers
C++ get last character of string
C++
0 vote366 views1 answer
Do c++ ints neeed to be initlaized
C++
0 vote346 views1 answer
C++ sort numbers by magnitude/absolute value
C++
0 vote350 views1 answer
Sfml get position
C++
0 vote335 views1 answer
Delay millis arduino
C++