# which DFS algorithm to follow?

164 views

there are multiple algorithm of DFS available and i cant figure out which one to follow for solving question asking for the nodes which aren’t pushed into the stack or the nodes which are pushed more than once,

Tried to figure out from already asked question but still can’t get it,

https://gateoverflow.in/98484/dfs-using-stack

https://gateoverflow.in/161225/dfs-number-of-nodes-not-pushed-into-the-stack

0

Always use the standard algorithm which uses Stack until and unless mentioned the other way around.

## Related questions

1
218 views
Let T be a depth first search tree in an undirected graph G. Vertices u and ν are leaves of this tree T. The degrees of both u and ν in G are at least 2. In such case in the graph there will be two cycles :- One Cycle will contain u and other one v. There cannot be a graph containig a single cycle and containing both u and v and also satisfy above Constraint. Am I right?
1 vote
2
492 views
Which of the following statement is correct regarding DFS? 1) All the vertices are pushed in the stack during DFS Traversal. 2) No vertex is pushed more than once in the stack during traversal.
3
137 views
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time, but I can't be able find that algorithm. Someone please share that.