Graph traversal - Depth first search|DFS

#DFS #graphtraversal #depthfirstsearch

This is one of the important Graph traversal technique. DFS is based on stack data structure.
Analysis:

The time complexity of DFS using Adjacency list is O(V + E) where V & E are the vertices and edges of the graph respectively.

[wednesdayaddams]

These people pave our life and education thanks a lot for helping ❤❤

[DeepakKumar-dwre]

Thanks Sir for your great effort. i can see your efffort in sweat.
thank you once again sir😇

[ngugaming]

i have never seen a sir like you...the effort you r keeping for us♥ we r indebted for you sir..really amazing almost my whole class of 70 members follows ur channel

[prabhathvarma]

Sir, you really explain well. It's like you already know the major students doubts and where they'll occur. Please consider joining in our college as Sr.Lecturer.

[vamsikrish]

Thanks sir tomorrow is my exam... Thanks sir... 😊💐🌹🎉

[thrisha]

Tq so much tmrw my exam... You saved me 😇

[phanisriimmalaraju]

sir your videos helped me and my friends to get good marks in semester🙏

[gainknowledge]

Is A, B, C, G, F, E, D is correct with out using back traversing

[Sravanthi]

Sir can we write program for dfs algorithm instead of writing step1, step2, .... algorithm?

[tejapraveendevarajuobulase]

AEFGCBD IS CORRECT if i start from bottom level

[chandrikac]

Sir Is it compulsory to do backtracking?

[srinivassss]

Sir is that mandatory to keep empty stack after 8th step

[psrinivasulreddy]

My favourite in YouTube channel I have passed in Sem due to because of this sir so pls like, share, subscribe

[zvqlnum]

Sir we want a dfs program in c language sir