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

12 votes158 views2 answers
How can I convert a string in char in c++?
C++
8 votes187 views3 answers
Min in c++
C++
111 votes307 views6 answers
Convert integer to string c++
C++
1 vote175 views1 answer
C++ char define
C++
0 vote172 views1 answer
Closing a ifstream file c++
C++
1 vote174 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
2 votes153 views1 answer
Is javascript for websites only
C++
18 votes175 views5 answers
Clear console c++
C++
0 vote166 views1 answer
Create new node in tree
C++
1 vote164 views3 answers
Auto in cpp
C++