Depth First Search

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.

[Jajdjejwi]

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

[robinkarlsson]

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 👍

[wrightkuku]

this guy is underrated. he deserves a million subscribers and billion views

[iq_pi]

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

[ahmedibrahim-rosj]

sir you are great, hope you going to continue uploading more videos, have never seen someone illustrate in that simple and precise way

[pedrolopes]

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

[Ha-obeidat_]

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

[TrangPham-kcft]

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

[telmagiovana]

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

[jordan]

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

[sigqibotshapha]

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

[rafifelfazri]

Thank you, it really helps me with my homework

[RajVerma-lgkp]

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

[hazemabuaqolah]

SUPER!! thank you for awesome presentation.

[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.

[zenitsuzang]

I feel very understandable - exactly what I am looking for

[geoffreyvanwyk]

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

[beone]

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

[dilantaskn]

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?

[prasundas]

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