depth first search stack

Long Lobster answered on November 25, 2020 Popularity 9/10 Helpfulness 1/10

answer depth first search stack

depth first search stack

Comment

    DFS-iterative (G, s):                                   //Where G is graph and s is source vertex
      let S be stack
      S.push( s )            //Inserting s in stack 
      mark s as visited.
      while ( S is not empty):
          //Pop a vertex from stack to visit next
          v  =  S.top( )
         S.pop( )
         //Push all the neighbours of v in stack that are not visited   
        for all neighbours w of v in Graph G:
            if w is not visited :
                     S.push( w )         
                    mark w as visited


    DFS-recursive(G, s):
        mark s as visited
        for all neighbours w of s in Graph G:
            if w is not visited:
                DFS-recursive(G, w)

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: www.hackerearth.com

Tags: depth-first-search stack whatever

Link to this answer
Share Copy Link