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 vote264 views1 answer
To toggle (flip the status of) the k-th item of the set
C++
0 vote258 views1 answer
Why wont a function stop C++
C++
0 vote259 views1 answer
Store array in vector
C++
0 vote296 views1 answer
Dream speedrun music free download mp3
C++
0 vote287 views1 answer
Bounded and unbounded solution in lpp
C++
0 vote262 views1 answer
CudaMalloc
C++
0 vote266 views1 answer
How to grab each character from a string
C++
0 vote271 views1 answer
Imports the elements in the array c++
C++
24 votes296 views5 answers
Size of array
C++
0 vote259 views1 answer
Print value of data in c++
C++