lmao 2 hours lecture at my uni is summed up perfectly here in 7 minutes. Amazing!
@iq_pi72114 жыл бұрын
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
@islammmmdov10446 күн бұрын
yes billion people on earth wants to know what is depth first search
@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
@ahmedibrahim-ro3sj Жыл бұрын
sir you are great ,hope you going to continue uploading more videos , have never seen someone illustrate in that simple and precise way
@Ha-obeidat_5012 ай бұрын
افضل دكتور يشرح عن الماده شكرا لككككككككك 🥰
@TrangPham-kc7ft4 жыл бұрын
Thank you so much for your explanation about DFS search tree, I've always get stuck at it but now it's more clearly
@sigqibotshapha99503 жыл бұрын
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-lg3kp6 жыл бұрын
My teacher should be fired 😂... Thank you so much
@telmagiovana60066 ай бұрын
Thank you, best explanation! Wish I had watched your videos before
@pedrolopes97216 жыл бұрын
Thank for your videos, my theory classes are really bad, and your youtube videos are saving, literally my life!
@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.
@guidodinello13693 жыл бұрын
You can use whatever order you want to fill the stack, you will still traverse the entire component but following a different path
@omarsheekhoo92055 жыл бұрын
Thank u so much, I finally understood the DFS and also for saving me from all of these Indians.
@manikantamaddipati48616 жыл бұрын
great explanation John Levine
@f_128911 ай бұрын
youre a life saver ❤️❤️
@rafifelfazri32844 жыл бұрын
Thank you, it really helps me with my homework
@geoffreyvanwyk45883 жыл бұрын
After expanding A, should you not have stopped at G1?
@hazemabuaqolah92062 жыл бұрын
SUPER!! thank you for awesome presentation.
@manuelacquistapace80302 жыл бұрын
Amaizingly explained, thanks a lot
@prasundas653111 ай бұрын
Why not go to goal G1 when we are checking if B or G1 has been traversed first?
@beone8888 ай бұрын
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
@sqlyoutuber82306 ай бұрын
Thank you
@zenitsuzang95065 жыл бұрын
I feel very understandable - exactly what I am looking for
@tzaswit3 жыл бұрын
Thank you, really helpful
@saraharar31144 жыл бұрын
thank you so much ! incredible
@dilantaskn9282 жыл бұрын
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?
@chandanagubbiparamesha9046 жыл бұрын
Awesome!!..please make more videos
@maksymkoval98165 жыл бұрын
More like A+ for those tutorials
@annasahebpatil26547 ай бұрын
Is there goal state for bfs nd dfs
@azarku4 жыл бұрын
THANK you !
@nadaali55 жыл бұрын
i love your way thank u
@samsricatjaidee4054 жыл бұрын
Thank you.
@lancelofjohn69952 жыл бұрын
why is G1 not removed?
@abdolvakilfazli24885 жыл бұрын
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?!
@stevenpersoon11 ай бұрын
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.
@ggme78576 жыл бұрын
how do you decide the order of the nodes e.g. A B D. Because it really changes things
@vyomdirt6 жыл бұрын
Alphabetical order.
@vincent-uh5uo6 жыл бұрын
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.
@karamkassem98214 ай бұрын
The problem should specify it, if not it can be random. Good way is to go from left to right, or from right to left or even if there are letter to follow alphabetic ordering
@halkey40863 жыл бұрын
Helal hocam, teşekkürler.
@isurukottahachchi61562 жыл бұрын
Good video but sound is not enough
@tomcolgan4 жыл бұрын
get a bigger board LOL, ah no all joking aside that was a very good explanation! really enjoyed it
@abrahamjonathan326011 ай бұрын
S,A,B,C,F,G3🤔
@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).