Depth First Search

  Рет қаралды 101,729

John Levine

John Levine

Күн бұрын

Пікірлер: 52
@Jajdjejwi28
@Jajdjejwi28 4 жыл бұрын
lmao 2 hours lecture at my uni is summed up perfectly here in 7 minutes. Amazing!
@iq_pi7211
@iq_pi7211 4 жыл бұрын
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
@wrightkuku8811 Жыл бұрын
this guy is underrated. he deserves a million subscribers and billion views
@islammmmdov1044
@islammmmdov1044 6 күн бұрын
yes billion people on earth wants to know what is depth first search
@robinkarlsson1460
@robinkarlsson1460 2 жыл бұрын
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 👍
@jordan4890
@jordan4890 4 жыл бұрын
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
@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_501
@Ha-obeidat_501 2 ай бұрын
افضل دكتور يشرح عن الماده شكرا لككككككككك 🥰
@TrangPham-kc7ft
@TrangPham-kc7ft 4 жыл бұрын
Thank you so much for your explanation about DFS search tree, I've always get stuck at it but now it's more clearly
@sigqibotshapha9950
@sigqibotshapha9950 3 жыл бұрын
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-lg3kp
@RajVerma-lg3kp 6 жыл бұрын
My teacher should be fired 😂... Thank you so much
@telmagiovana6006
@telmagiovana6006 6 ай бұрын
Thank you, best explanation! Wish I had watched your videos before
@pedrolopes9721
@pedrolopes9721 6 жыл бұрын
Thank for your videos, my theory classes are really bad, and your youtube videos are saving, literally my life!
@pantepember
@pantepember 3 жыл бұрын
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
@guidodinello1369 3 жыл бұрын
You can use whatever order you want to fill the stack, you will still traverse the entire component but following a different path
@omarsheekhoo9205
@omarsheekhoo9205 5 жыл бұрын
Thank u so much, I finally understood the DFS and also for saving me from all of these Indians.
@manikantamaddipati4861
@manikantamaddipati4861 6 жыл бұрын
great explanation John Levine
@f_1289
@f_1289 11 ай бұрын
youre a life saver ❤️❤️
@rafifelfazri3284
@rafifelfazri3284 4 жыл бұрын
Thank you, it really helps me with my homework
@geoffreyvanwyk4588
@geoffreyvanwyk4588 3 жыл бұрын
After expanding A, should you not have stopped at G1?
@hazemabuaqolah9206
@hazemabuaqolah9206 2 жыл бұрын
SUPER!! thank you for awesome presentation.
@manuelacquistapace8030
@manuelacquistapace8030 2 жыл бұрын
Amaizingly explained, thanks a lot
@prasundas6531
@prasundas6531 11 ай бұрын
Why not go to goal G1 when we are checking if B or G1 has been traversed first?
@beone888
@beone888 8 ай бұрын
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
@sqlyoutuber8230
@sqlyoutuber8230 6 ай бұрын
Thank you
@zenitsuzang9506
@zenitsuzang9506 5 жыл бұрын
I feel very understandable - exactly what I am looking for
@tzaswit
@tzaswit 3 жыл бұрын
Thank you, really helpful
@saraharar3114
@saraharar3114 4 жыл бұрын
thank you so much ! incredible
@dilantaskn928
@dilantaskn928 2 жыл бұрын
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?
@chandanagubbiparamesha904
@chandanagubbiparamesha904 6 жыл бұрын
Awesome!!..please make more videos
@maksymkoval9816
@maksymkoval9816 5 жыл бұрын
More like A+ for those tutorials
@annasahebpatil2654
@annasahebpatil2654 7 ай бұрын
Is there goal state for bfs nd dfs
@azarku
@azarku 4 жыл бұрын
THANK you !
@nadaali5
@nadaali5 5 жыл бұрын
i love your way thank u
@samsricatjaidee405
@samsricatjaidee405 4 жыл бұрын
Thank you.
@lancelofjohn6995
@lancelofjohn6995 2 жыл бұрын
why is G1 not removed?
@abdolvakilfazli2488
@abdolvakilfazli2488 5 жыл бұрын
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
@mohammedshalan9161 Жыл бұрын
That's also my question! I couldn't figure it out?!
@stevenpersoon
@stevenpersoon 11 ай бұрын
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.
@ggme7857
@ggme7857 6 жыл бұрын
how do you decide the order of the nodes e.g. A B D. Because it really changes things
@vyomdirt
@vyomdirt 6 жыл бұрын
Alphabetical order.
@vincent-uh5uo
@vincent-uh5uo 6 жыл бұрын
yes it is also my question, if he decided the order is G2, F, S in the forth floor, the algorithm will stop.
@ravikumarrn8501
@ravikumarrn8501 5 жыл бұрын
Check out the arrow direction of C. From S u can't go to C.
@karamkassem9821
@karamkassem9821 4 ай бұрын
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
@halkey4086
@halkey4086 3 жыл бұрын
Helal hocam, teşekkürler.
@isurukottahachchi6156
@isurukottahachchi6156 2 жыл бұрын
Good video but sound is not enough
@tomcolgan
@tomcolgan 4 жыл бұрын
get a bigger board LOL, ah no all joking aside that was a very good explanation! really enjoyed it
@abrahamjonathan3260
@abrahamjonathan3260 11 ай бұрын
S,A,B,C,F,G3🤔
@pixelsvuce1572
@pixelsvuce1572 6 жыл бұрын
Node d is mentioned again..Check the presentation again...Plz....
@omarzalama
@omarzalama 6 жыл бұрын
no it's not, it just appeared, we never expand it (branch it to it's nodes).
@ahmedwael4293
@ahmedwael4293 3 жыл бұрын
عايز اموت
@maryameslam3782
@maryameslam3782 Жыл бұрын
thank you
Breadth First Search - Part 1
8:17
John Levine
Рет қаралды 83 М.
Uniform Cost Search
10:23
John Levine
Рет қаралды 411 М.
Mom had to stand up for the whole family!❤️😍😁
00:39
Cool Parenting Gadget Against Mosquitos! 🦟👶 #gen
00:21
TheSoul Music Family
Рет қаралды 33 МЛН
Minimax with Alpha Beta Pruning
13:44
John Levine
Рет қаралды 343 М.
Learn Depth First Search in 7 minutes ⬇️
7:41
Bro Code
Рет қаралды 88 М.
Depth First Search Algorithm | Graph Theory
10:20
WilliamFiset
Рет қаралды 473 М.
A* Search
12:32
John Levine
Рет қаралды 421 М.
Depth First Search (DFS) on Directed graphs and Cyclic Graphs
13:17
Turing Machines
Рет қаралды 51 М.
Lecture 13: Breadth-First Search (BFS)
50:48
MIT OpenCourseWare
Рет қаралды 704 М.