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 vote312 views1 answer
Through map c++
C++
1 vote291 views1 answer
Vector with pinter cout c++
C++
-1 vote251 views1 answer
How to insert all values from one vector to another
C++
0 vote342 views1 answer
Vprintf
C++
0 vote300 views1 answer
Reverse Square Root
C++
1 vote282 views2 answers
C++ cast to type of variable
C++
0 vote293 views1 answer
Definition of singly linkedlist
C++
1 vote238 views1 answer
Add element to start of vector c++
C++
0 vote284 views1 answer
Windows servis from console app
C++
21 votes368 views3 answers
C++ access second last element of vector
C++