Hey well academy sorry I don't know your name BTW I want to thanks to you. Your all video helps me alot in my exams. I'm very very thankful to you Thank you so much. I attempted my AI paper very easily just coz of you otherwise 3 days before I was tensd for my exams. You are doing great job 👌❤
These are the best explanation i ever got for Algos. I really Appreciate the way you have explained the Algo. Also i have seen multiple videos on various other Algos. Great work guys.
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. en.m.wikipedia.org/wiki/Tree_(graph_theory)
Follow us on :
Facebook : facebook.com/wellacademy/
Instagram : instagram.com/well_academy
Twitter : twitter.com/well_academy
every time before exam your vedio become very helpful to my all group........
ohh sachi yaar
Exam from 11.00am and I m watching at 9.00am. :v
tnx
@@Alone-fx6uh You are a true engineer my friend \m/
Bhai Video hota hai 😂😂😂
Nicely explained, inspiring to see a young tutor like you.
You are like a saviour to us in studying during exams time
Thank you so much Sir. Your videos are a big reason that I got my AI cleared :)
Double Thanks bhai iss video k wajhe se mere friend ka exam aacha Gaya aur woh pass ho jayega uss taraf se Thhaannkk you!!! u rock bro 😀👍
tu kabhi nahi sudhrega chetan sharma
thank you for keeping the lectures free,short and to the point.you should do more definitely !
Hey well academy sorry I don't know your name BTW I want to thanks to you. Your all video helps me alot in my exams. I'm very very thankful to you Thank you so much. I attempted my AI paper very easily just coz of you otherwise 3 days before I was tensd for my exams. You are doing great job 👌❤
you are amazing ....thanks for such a priceless lectures. hope to see more from you. thank you so much
UR efforts are great. U MADE AI so easy. Dear, teachers like U are always honoured.
thanku for helpful videos i have seen many videos on utube but nly urs is understandable thanku nd plz keep giving more.
Wah!! Bahut msst samjaye h aap,,
Thanku SirG
nice video....and easy to learn ....seriously.... and very helpful....thank u ...
A very clear and easy to understand demonstration.
Meri tou teacher bhi apkay lectures dekh kr parhati hai 😁 nice and thanks
hahahahah
Haha
lolzzzzzzzzzzzzzzz
Same here
Phir teacher change karo
nothing can be good than this. awesome brother thank you
Shailesh Chandra lol
Awsom video...
Easy to understand ...
Bxt lecture ...
Thnkx..
From pak
your way of teaching is very gd.. thank u
Thankyou bhaiya .....great job
Perfect lecture...our college professor must have to learn from you..
Very nice.... Loved it.. 👌😍
keep it up.. waiting for next helpful videos like this...
Thnku for the topic easy to explain ...
nice video....and easy to learn AI
really awesome video sir....thank you so much
Good job Sir keep it up🖒🖒🖒🖒🖒...
and see after this video my doubt is clear.
.good Thanku so much make a this lecture..
Great explanation sir🙏🙏👍
Thanks sir for your help in this topic
Best One .. Keep Going (y)
Thank you so much.... Very brilliant videos...
I love Pakistani girl
Ek number bhai!!!
Thank u for your videos it help me lot and I get well score from all the helpful videos.
Explanation techniques is awesome 👌
You are awesome ..nice lectures! Keep it up
Thank you soo much sir for explaining soo well... Your videos are soo helpful... Thnx..😊😊
Great work Bro.
From Bahria University Islamabad Pakistan.
thnk uu so muchh .it will really helpful i clearly understand this tooic . i hop god will bless u ..
thankyou so much.. your lecture really helped me.
Ur video is very helpfull to me
I am from Pakistan and Your videos are very helpfull for me as well as my group.. (Thanks again).. :)
khi say ho bhai india is best
Pakistan me bhi Engineer hote hai
its help me alot ..thank u
Thank you. No mistakes!
Well explained. Kepp going.😁
well teached n really helpful ...thank u😊
These algorithm .A* easily explain... Sir
thank u so much
clear explanation. thank you so much
your lectures are amazing, Respect From Pakistan! (Y)
Great explanation.....love it :)
this was really helpful :) greeting from nepal
AI ko exam parsi :D :D
haha :D
😂😂😂 ai is comung 😭
Nepali Shabji 😂😂😂
oo shabji
You should be doing videos in english as well, but thanks for this one even though I dont understand the language
very helpful, plz also add learning rules
It's really good ,thanks
Sir bohot accha sikhaya hai aapne thank you
These are the best explanation i ever got for Algos.
I really Appreciate the way you have explained the Algo. Also i have seen multiple videos on various other Algos.
Great work guys.
Great explanation
great explanation! nailed it!
Thank u 🙏.. So much sir
10:37 Please don't abuse anyone ;-P
Lol
behtreen! keep it up!
Very helpful bro thanks
thanx for making it easy :)
Thank you so much! You saved me.
Welcome dear
At 8:58, is it 5 or maybe 3? btw your teaching style is awesome.
ya it is 5 :)
This was really heplful thanku🙂🙂
We can use this to estimate the interest of unique visitors. Like- guessing next food/restaurant/article/item my customer would like to choose.
Thanks a lot. Really helped ....awesome
Wow really helpfull sir I from nepal
V.nice man..keep it up
Thankyou sir ji,i like your lecture
Thanks for A* algorithm. Please Make video on IDA* algorithm...
Thank you so much sir 😁
You are awesome! keep up the excellent work!!
thanks for the great video!
it would have been helpful if you could provide an example at the end for students to solve themselves
much informative before xam
thanks a lot.. really helpful
In this we can draw and given our own values,it will work
Wonderful video, but could you please share how to write the algorithm as well along with the keywords, it'll be really helpful.
Thanks
at 9:56 you miscalculated 8. the answer is 9. also Sir(anyone seeing the comment too), I wanted to ask what is the final answer??
it will not be 9 it will be 8 only
thnx boss
and very nice
2:11 It is a Graph, not a Tree. (Since it has loops)
Its tree
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
en.m.wikipedia.org/wiki/Tree_(graph_theory)
Awesome👏✊👍
your videos are really helpful...Btw you look very cute. ;)
thank you so much brother💯
awsm work bro
good video i maniy time Healfull
Thanks sir,💝💝👍👍👍👏👏👏
Sir, Thanks alot your videos are really helpful and it did save me during my exams, just one request can you make videos on mongodb
good one, thanks
good explaination
very nice 👍🏻
Best videos for AI in hindi
Nice
Sir ismy agr direct qstion pucha jata hai ... To kya hueristic value particular point k liye given hogi ya khud s nikalni jogi?
Comprehensive video but A* is read as "A Star"
Very Nice ..
very helpful 4 exms😊
thanks from Bangladesh
Thanks Man!
Really nice sir
good job bro...
You said we avoid path which are already expensive but I didn't understand that statement according to your example ....