Depth First search (DFS) | Depth limited search(DLS ) | Artificial Intelligence | (Eng-Hindi) #11

[@sparrow2068]

I'm indian-american, don't speak hindi. But somehow I was able to understand this whole video. Props to you young lad

[@imranahmad3896]

Thanks Sir,
The concept you define about Depth First Search is really very nice. Now I will easily clear Algorithm Lab in my MCA 4th semester this time.

[@adityachopra3759]

"An infinite loop is only going to happen if the tree is having unlimited branches". Correct me if I'm wrong.

[@bhavyaanand7363]

wrong

[@onetrick719]

You're doing great effort. Only one suggestion, please mention *Time and Space* Complexity of each algorithm at the end of your video. Thank your.

[@SS-fz6qt]

In artificial intelligence, searching or problem solving using DFS is a little bit changed as compared to DFS Traversal in Data Structures, in ARTIFICIAL INTELLIGENCE, DFS and BFS use Queue, and two lists OPENED(unvisited) and CLOSED(visited) are maintained, in DFS , ENQUEUE (Insertion) takes place at start , whereas ENQUEUE (Insertion) takes place at end in BFS. IT IS A HIMBLE ADVICE TO GO THROUGH ARTIFICIAL INTELLIGENCE BOOK GEORGE LUGAR, and STUART RUSSELL to clear your own concept before making videos for those students who even never got the book and rely on your videos. Thanks

[@TechnicalBabaji1]

You hv explain little wrong about dfs algorithm... In dfs what happen it will push all the children node.. and u know that stack implement LIFO so if A is not a goal node then BC will be pushed so B wil be in the top of stack and so on. But hv only push to B in the stack and what about C node..

[@Surya-nc8lv]

This is not BFS where we traverse along each row. In DFS we go to the depth and if there no other possible nodes then we backtrack. so for the above problem in video the order we traverse will be ABDECFG

[@yadneshkhode3091]

Technical babaji chutiye

[@rekhaattri3965]

Why you did not use stack to explain your dfs example??

[@zeeshanahmadkhalil8920]

3:22

[@krishnasiddhartha]

is iterative depth search and dLs same?

[@Afro0422]

No

[@KaleemUllah-qi7hf]

wow kia baat hy good ;n one but explain root left right i think its missing

[@sidrarani4770]

sir, Excuseme
which one is more better in DFS nd BFS ??

[@vidoclock8761]

ua-cam.com/video/8C_eBEQPZbY/v-deo.html
WATCH THIS ONE

[@yadneshkhode3091]

Dfs....less space complexity

[@ramandavid2047]

sir convex hull kya hai plllzzzz bataaoo

[@nika-bm8pb]

what is this language?

[@ahsanali9646]

Sir plz complete the output ABDEC??

[@dls6923]

ABDECFG

[@entertainmentpoint7965]

Hi Sir,
Can you please make video on expectimax algorithm

[@qayyumzakaria2470]

Althought idk hindi but i can understand what he trying to explain c:

[@nehalansari9541]

who to find solution cost in dfs

[@safakozkan6698]

What language is this in?

[@hiteshbhatia8333]

Hindi + English :)

[@nandyhaaru9298]

hindi

[@aditya_das]

High Valyrian

[@AbdUllah-ru1yz]

Great job sir

[@DimagMindBuddhi]

What is pop a node

[@unknownman1]

deleting a node

[@ramandavid2047]

thanku sir and ap english kam use kre pllllzzz ya fr ap jo english me bolte hai vo hindi ya punjabi ma repeat krdea keje pllzz

[@i_deepeshmeena]

punjabi m lol kal koi bolega bangali fir koi bolega telugu m

[@PradeepKumarIIITD]

arre pura cllege yahi h aaj

[@pranjalsharma499]

very well said

[@malkitsingh7780]

V nice and v helpful sir.

[@WellAcademy]

Thank you so much

[@annuramawat6940]

Nice explanation sir

[@gungunghatiya6285]

but sir yah kya search karata hai

[@akbarimomin4374]

Plz tell me the complexity of DFS

[@kamranhusain2829]

O(V+E) V->no of vertices & E-> no of edges(if graph is directed)

[@akbarimomin4374]

Kamran Husain mere exams ho gye😂

[@arshiqureshi2238]

Thanks sir

[@yadneshkhode3091]

Thankyou so much sir!!!!!!!!!!

[@shrirangpathak2927]

Thanks brother

[@nikcalligraphy]

nice explanation

[@kundetinagasumanth616]

Nice Explatation

[@namankapoor1]

Where is "Artificial Intelligence"

[@AshutoshKumar-vu1ns]

Well

[@jspmbit122]

tik

[@kush5749]

tik

[@ankitatoons6585]

You are so cute.

[@sadanandyadav3238]

Didi sikhne aai ho ya ishq ladane😂😂😂

[@amritpreetarora731]

Wrong.
Gate Smashers teach better and correct. 👍

[@0wninguplz]

cannot understand a word

[@VARUN-gn5kq]

Jaake chupa chups khao🤣