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 vote105 views1 answer
Size of a matrix c++
C++
0 vote130 views1 answer
Cpp language explained
C++
0 vote112 views1 answer
Abstraction in cpp
C++
0 vote118 views1 answer
How to run cpp using gcc vscode
C++
0 vote69 views1 answer
Case 1 or 2 c++
C++
0 vote103 views1 answer
Fast i/o in c++
C++
0 vote130 views1 answer
Yearly interest calculator c++ using for loop
C++
21 votes120 views6 answers
Random in c++
C++
0 vote114 views1 answer
What is xor_eq c++
C++
0 vote136 views1 answer
Flutter run specific device
C++