The simplest version of depth first search, how it gets stuck in loops and how to fix this using simple loop checking on the path.
Пікірлер: 51
@Jajdjejwi283 жыл бұрын
lmao 2 hours lecture at my uni is summed up perfectly here in 7 minutes. Amazing!
@sofuno8633 жыл бұрын
somehow this english accent makes me feel smart when I listen to it lol amazing!
@TheMcallist13 жыл бұрын
hahaha
@iq_pi72113 жыл бұрын
Finally I found a Dr. That deserve the title The AI Dr. In my college is all over the place She makes the easiest thing hard to understand
@wrightkuku8811 Жыл бұрын
this guy is underrated. he deserves a million subscribers and billion views
@TrangPham-kc7ft3 жыл бұрын
Thank you so much for your explanation about DFS search tree, I've always get stuck at it but now it's more clearly
@robinkarlsson14602 жыл бұрын
Trying to explain this to a friend and your description of the algorithm in terms of a decision tree was brilliant. Makes things super clear (why we keep track of visited becomes self evident)! Great video 👍
@jordan48904 жыл бұрын
Really nice videos man. I'm using search to derive equations in physics as a newcomer to CS. Your videos have helped immensely as a noob to CS research
@pedrolopes97215 жыл бұрын
Thank for your videos, my theory classes are really bad, and your youtube videos are saving, literally my life!
@ahmedibrahim-ro3sj11 ай бұрын
sir you are great ,hope you going to continue uploading more videos , have never seen someone illustrate in that simple and precise way
@telmagiovana6006Ай бұрын
Thank you, best explanation! Wish I had watched your videos before
@manikantamaddipati48615 жыл бұрын
great explanation John Levine
@sigqibotshapha99502 жыл бұрын
would've been neat to know the order of traversing the child nodes beforehand. also in an actual programming stack, we would have to add the child nodes(i.e expand) in reverse order such that our topmost node after each expansion is the next first node (i.e when expanding S start by adding D to the stack, then B then A such that A is at the top of the stack), so we should draw the tree down towards the right not left, same thing just on opposite sides. I'm terrible at explanations but I picked this up from your video which means it's great
@RajVerma-lg3kp5 жыл бұрын
My teacher should be fired 😂... Thank you so much
@manuelacquistapace80302 жыл бұрын
Amaizingly explained, thanks a lot
@rafifelfazri32843 жыл бұрын
Thank you, it really helps me with my homework
@hazemabuaqolah92062 жыл бұрын
SUPER!! thank you for awesome presentation.
@omarsheekhoo92055 жыл бұрын
Thank u so much, I finally understood the DFS and also for saving me from all of these Indians.
@zenitsuzang95065 жыл бұрын
I feel very understandable - exactly what I am looking for
@saraharar31144 жыл бұрын
thank you so much ! incredible
@tzaswit3 жыл бұрын
Thank you, really helpful
@f_12896 ай бұрын
youre a life saver ❤️❤️
@chandanagubbiparamesha9045 жыл бұрын
Awesome!!..please make more videos
@azarku4 жыл бұрын
THANK you !
@nadaali55 жыл бұрын
i love your way thank u
@pantepember3 жыл бұрын
1- In what order do we choose the items at each level? (You choose them in alphabetical order. Why?) 2- You say we treat the items list like a stack then you choose A at the first level. But how did we order them as A, B, and D in the first place? By the way, I really like the way you teach. Thank you.
@guidodinello13692 жыл бұрын
You can use whatever order you want to fill the stack, you will still traverse the entire component but following a different path
@maksymkoval98165 жыл бұрын
More like A+ for those tutorials
@geoffreyvanwyk45882 жыл бұрын
After expanding A, should you not have stopped at G1?
@samsricatjaidee4053 жыл бұрын
Thank you.
@dilantaskn928 Жыл бұрын
Probably with these tutorials I learned AI algorithms way more than what I learned in class, but since this algorithm is LIFO, shouldn't it start to generate nodes from the D since it is the last one entered into the stack and should be the first one to get out, instead of A?
@sqlyoutuber823012 күн бұрын
Thank you
@maryameslam3782 Жыл бұрын
thank you
@halkey40863 жыл бұрын
Helal hocam, teşekkürler.
@annasahebpatil26542 ай бұрын
Is there goal state for bfs nd dfs
@prasundas65315 ай бұрын
Why not go to goal G1 when we are checking if B or G1 has been traversed first?
@beone8883 ай бұрын
I'm not able to understand in which order he is exploring the node, if there is no order then after exploring A we can explore G1,B then the algo stop at G1 itself, that is the path will be S -> A -> G1
@lancelofjohn69952 жыл бұрын
why is G1 not removed?
@ggme78575 жыл бұрын
how do you decide the order of the nodes e.g. A B D. Because it really changes things
@vyomdirt5 жыл бұрын
Alphabetical order.
@vincent-uh5uo5 жыл бұрын
yes it is also my question, if he decided the order is G2, F, S in the forth floor, the algorithm will stop.
@ravikumarrn85015 жыл бұрын
Check out the arrow direction of C. From S u can't go to C.
@tomcolgan4 жыл бұрын
get a bigger board LOL, ah no all joking aside that was a very good explanation! really enjoyed it
@abdolvakilfazli24884 жыл бұрын
After first A, why did you choose B over G1. If you have chosen G1 over B that would be a better depth-first search
@mohammedshalan9161 Жыл бұрын
That's also my question! I couldn't figure it out?!
@stevenpersoon6 ай бұрын
This choice is not really specified for depth search. How the algorithm chooses the next is node up for you to decide, as long as it's consistent.
@isurukottahachchi61562 жыл бұрын
Good video but sound is not enough
@pixelsvuce15726 жыл бұрын
Node d is mentioned again..Check the presentation again...Plz....
@omarzalama6 жыл бұрын
no it's not, it just appeared, we never expand it (branch it to it's nodes).