Breaking News: Grepper is joining You.com. Read the official announcement!

bfs sudocode

Famous Falcon answered on April 27, 2021 Popularity 3/10 Helpfulness 3/10

answer bfs sudocode

bfs sudocode

Comment

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.

Popularity 3/10 Helpfulness 3/10 Language cpp

Source: www.hackerearth.com

Tags: c++

Link to this answer
Share Copy Link