Depth First Traversal for a Graph | GeeksforGeeks

i love u

Best video I have ever seen ,in no time all my concepts are clear ❤

Sir please explain us code

But the stack is not used here, it is a recursive approach.

Excellent Job, Thanks for your service

i could not find stack in gfg code

Is this traversal unique?.. I mean does it give a unique traversal?

That means, output of many students can be differ with each other ?

thanks illuminati for the contribution

This video helped me a lot. Thank you.

Please ,make a video lecture for GetPath_DFS problem.

i want to ask why did u visit E after D, why not F?? I'm confused about it

u just explain only the algorithm......but what about code.....F

Please order the playlist properly

This video works for me. I understand the concept now. Thanks!

You gave us the idea using stack, but implementing recursively on website/example.

excellent videos! I thoroughly understand graphs now

Suppose we go in the order of A B and then E, what condition would make it go to F but not C? Would the order A B E C F D also be a depth-first traversal?

Where is the use of stack here?????

I want dfs and bfs with graphics

DFS GOD

how do you mark as visited on template values?

you are doing absolutely wrong man this is DFS or BFS

Thank u

watch at 3x

gay

after visiting E why we are not visiting C (alphabetically).I think we have to visit C first and then F

why we use only stack in dfs but not queue

Thanks I am a Bangladeshi student

"This video is contributed by Illuminati." woh... what?

This is not DFS bro

How we can visit E after D if we are following depth first? Isn't it making this a breadth first approach ?

what the hack is going on man

thank you sir...

After reaching E why we haven't take C but took F

why u choose node F after node E? why not node C?

the order should be ABDECF if u follow alphabetically

Wrong

Can i visit node f from d instead of e? if yes then my answer would be ABDFEC. Will it also be correct?

This video is contributed by Illuminati wtf?

A,B,D,E,C,F it should be

Are two or more answer possible in DFS??

Plz write n explain psuedo or algorithm.

c must pushed to stack and visited before f since c is comes before f alphabetically

Thanks for notes but you didn't clarify the most important thing which is the code

at 1.25 speed it looks good

Why you visit F from E instead of C as C comes first in alphabetical order?

plz explain code also