Graph traversal - Depth first search|DFS
Vložit
- čas přidán 7. 09. 2024
- #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.
These people pave our life and education thanks a lot for helping ❤❤
So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Thanks Sir for your great effort. i can see your efffort in sweat.
thank you once again sir😇
It's my pleasure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
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.
So nice of you. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Thanks sir tomorrow is my exam... Thanks sir... 😊💐🌹🎉
All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
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
All the best
Tq so much tmrw my exam... You saved me 😇
All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
sir u are explaning so good.
Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir u are a life saver thank you sir
You are most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir your videos helped me and my friends to get good marks in semester🙏
Congratulations. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Again you are legit god in my life
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
My favourite in CZcams channel I have passed in Sem due to because of this sir so pls like ,share, subscribe
So nice of you ❤️
Thank you so much sir 🎉
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you sir
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Thank you so much sir
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
AEFGCBD IS CORRECT if i start from bottom level
Yah correct only
@@SudhakarAtchala tanq
Sir Is it compulsory to do backtracking?
depends on problem. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Please explain with c code
Is A,B,C,G,F,E,D is correct with out using back traversing
yes. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala sure sir I am watching your vedios from so many days.you are the god for cse students.your hard work will definitely pay off to you sir.Glad to have the online guru like you sir❤️🙏
Tq sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Nice sir
Thanks . Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir can we write program for dfs algorithm instead of writing step1, step2,.... algorithm?
yes we can. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Sir is that mandatory to keep empty stack after 8th step
No, it's optional. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir plz tell the program for this
Okay sure very soon. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir please explain the algorithm
very soon i will upload sravani. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala definitely I will share with my frnds. Thank you for your response.
Sir we want a dfs program in c language sir
K. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir plz explain with code sir
As soon as possible. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Tomarrow i hv ds exam im so scared
All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..