Depth First Search

[@Jajdjejwi28]

lmao 2 hours lecture at my uni is summed up perfectly here in 7 minutes. Amazing!

[@iq_pi7211]

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

[@islammmmdov1044]

yes billion people on earth wants to know what is depth first search

[@robinkarlsson1460]

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 👍

[@Ha-obeidat_501]

افضل دكتور يشرح عن الماده شكرا لككككككككك 🥰

[@jordan4890]

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

[@sigqibotshapha9950]

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

[@TrangPham-kc7ft]

Thank you so much for your explanation about DFS search tree, I've always get stuck at it but now it's more clearly

[@pedrolopes9721]

Thank for your videos, my theory classes are really bad, and your youtube videos are saving, literally my life!

[@pantepember]

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.

[@guidodinello1369]

You can use whatever order you want to fill the stack, you will still traverse the entire component but following a different path

[@telmagiovana6006]

Thank you, best explanation! Wish I had watched your videos before

[@RajVerma-lg3kp]

My teacher should be fired 😂... Thank you so much

[@geoffreyvanwyk4588]

After expanding A, should you not have stopped at G1?

[@prasundas6531]

Why not go to goal G1 when we are checking if B or G1 has been traversed first?

[@beone888]

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

[@manikantamaddipati4861]

great explanation John Levine

[@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?

[@rafifelfazri3284]

Thank you, it really helps me with my homework

[@f_1289]

youre a life saver ❤️❤️

[@hazemabuaqolah9206]

SUPER!! thank you for awesome presentation.

[@manuelacquistapace8030]

Amaizingly explained, thanks a lot

[@annasahebpatil2654]

Is there goal state for bfs nd dfs

[@zenitsuzang9506]

I feel very understandable - exactly what I am looking for

[@ggme7857]

how do you decide the order of the nodes e.g. A B D. Because it really changes things

[@vyomdirt]

Alphabetical order.

[@vincent-uh5uo]

yes it is also my question, if he decided the order is G2, F, S in the forth floor, the algorithm will stop.

[@ravikumarrn8501]

Check out the arrow direction of C. From S u can't go to C.

[@karamkassem9821]

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

[@lancelofjohn6995]

why is G1 not removed?

[@maksymkoval9816]

More like A+ for those tutorials

[@tzaswit]

Thank you, really helpful

[@saraharar3114]

thank you so much ! incredible

[@chandanagubbiparamesha904]

Awesome!!..please make more videos

[@maryameslam3782]

thank you

[@abdolvakilfazli2488]

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?!

[@Steven-P99]

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.

[@samsricatjaidee405]

Thank you.

[@azarku]

THANK you !

[@nadaali5]

i love your way thank u

[@halkey4086]

Helal hocam, teşekkürler.

[@isurukottahachchi6156]

Good video but sound is not enough

[@pixelsvuce1572]

Node d is mentioned again..Check the presentation again...Plz....

[@omarzalama]

no it's not, it just appeared, we never expand it (branch it to it's nodes).

[@tomcolgan]

get a bigger board LOL, ah no all joking aside that was a very good explanation! really enjoyed it

[@abrahamjonathan3260]

S,A,B,C,F,G3🤔

[@ahmedwael4293]

عايز اموت

[@sqlyoutuber8230]

Thank you