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 vote317 views1 answer
How to declare a vector of int in c++
C++
3 votes327 views2 answers
Iomanip
C++
0 vote320 views1 answer
Initialize many variablles c++
C++
0 vote355 views1 answer
10^18 data type in c++
C++
2 votes299 views1 answer
How to interface c++ in haxe
C++
11 votes333 views5 answers
How to sort array in c++
C++
1 vote355 views4 answers
C++ pause
C++
0 vote308 views1 answer
Ordine crescente di numeri indefiniti in c++
C++
0 vote316 views1 answer
Map::begin
C++
-2 votes300 views2 answers
C++ random float
C++