Hey Guys, Now we have launched our own website www.gatevidyalay.com Kindly visit that website and you can download the notes from there and get other study material! If you can provide any suggestions regarding the improvement of UA-cam channel as well as website...we would definitely love to have them! All the best...Keep learning :)
I have seen a lot of videos on this algorithm, but the strength of my understanding has come here and completed. You are not a teacher, you are a teacher with great personality. Keep giving your guidance like this.
The problem that you have explain was very nice i saw so many video lecture but not clear understand when i saw this lecture right now clear thank you for your explanation keep it up ❤
hai sir Your channel is superb..Its really easy to learn all concepts at one shot..Thank you soo mch sir .Pls keep going.Im so glad i found this channel
Ur content was awesome and the way u explains is out of world... But I have only one request..kindly see to it the video is bit shaky sir...some disturbance while watching those handwritten notes sir..👍👍
Hey dear...0/1 knapsack using dynamic programming approach video is already available...Please check the Algorithms playlist! Bellman ford algorithm will be made available soon! Keep learning :)
Yes buddy...You are right! The algorithm outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix.
Bhai ye shortcut kya selfloop wale element mai sahi ans dega?? Kyuki mene check kia is shortcut nd using formula wale ans alag alag aa rhe hai.... Plzz help fast...
Thanks a lot dear for your appreciation :) Regarding the slow speed, you can increase the speed of the video by changing the settings! I hope that was helpful :) All the best...Keep learning :)
Thanks buddy for suggesting the topic! We will be back soon with some powerful tips for cracking the exam! Stay tuned by subscribing yourself to get the notification :) All the best...Keep learning :)
The algorithm actually outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix. However, with little modifications in the code, you can get the desired path. I hope you got the answer to you query :)
The algorithm actually outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix. However, with little modifications in the code, you can get the desired path. I hope you got the answer to you query :)
Hey Guys, Now we have launched our own website www.gatevidyalay.com
Kindly visit that website and you can download the notes from there and get other study material!
If you can provide any suggestions regarding the improvement of UA-cam channel as well as website...we would definitely love to have them!
All the best...Keep learning :)
I have seen a lot of videos on this algorithm, but the strength of my understanding has come here and completed. You are not a teacher, you are a teacher with great personality. Keep giving your guidance like this.
The problem that you have explain was very nice i saw so many video lecture but not clear understand when i saw this lecture right now clear thank you for your explanation keep it up ❤
i was doing th'o actual procedure .... it was taking lot of time.... this method reduced the time into 1/4 th..... thanks...
Happy to help you...The trick is especially meant for solving the question in exams...because there you are short of time! :)
ur handwriting is awesome...same as ur mind...
Thank you so much for such a nice compliment...!! :)
This is the most wonderful explanation! Thank you!
Thanks a lot buddy...All the best...Keep learning :)
Am so glad i found your vedio....Beautifully explained...and i liked the way you went slow keeping in mind the slow learners as well.
Thanks a lot for your appreciation...keep learning :)
Good Handwriting , Clear and Confident Voice and nice presentation!
Thanks a lot for such a nice complement :)
very good explanation .. was confused after watching other channel videos thank you so much sir
it was lengthy..but worth watching.thanks man.
Thanks for watching Keep learning :)
nice method of teaching ...............
Daymmm your handwriting bruh !
very usefull.. ye topic to pakka ho gya ab.. :-)
thank you sir..
Happy to help you...Keep learning :)
really your had writtening is very good
Thanks a lot dear! :)
All the best...Keep learning :)
The way you explain is very good.Keep going bro. Upload more topics as soon as possible !!!!
I will soon upload more videos....Stay tuned...All the best....Keep learning :)
Love u ur writing skills
hai sir
Your channel is superb..Its really easy to learn all concepts at one shot..Thank you soo mch sir .Pls keep going.Im so glad i found this channel
Thanks a lot buddy for your appreciation :)
Keep learning :)
its help me to pass the xm...god bless u sir
Thanks a lot dear for your wishes and appreciation!!
All the best...Keep learning :)
Love your hand writing
Thanks a lot buddy for your appreciation!
Stay tuned for more videos!
All the best..Keep learning :)
Ur content was awesome and the way u explains is out of world... But I have only one request..kindly see to it the video is bit shaky sir...some disturbance while watching those handwritten notes sir..👍👍
u simply nailed it.. awesome
Thanks dear for the appreciation.. :)
Excellent explaination and awsm handwriting brother.
Thanks a lot brother!
All the best...Keep learning :)
The infinity stuff is really helpful , infinity ha sari values same boom
Wow..I understood it very well now....Thanks
manisha mittal sex
Great. Superb.
Thanks buddy.. :)
beautiful explaination and amazing trick,,,thank you
Thanks...Keep learning :)
Do u understands hindi
@@anesugudo2548 yes after all i am indian. 😅
Absolutely nailed it man!!
Keep uploading bro!!
We need content like this!!😊
thankyou so much for these videos teaching method is ausome
Glad to help you buddy!
All the best...Keep learning :)
lovely handwriting brother
Sir please.. upload a video for Single source shortest path: Dijksatra's and Bellmann ford algorithm
Thanks for liking...I will very soon upload the required videos...stay tuned.. keep learning :)
sir harr jagh dekha smj nhi aya but ur lecture is ultimate
Happy to help you...All the best :)
Very good explanation sir..best video...
We are glad that you are liking our efforts!
We will keep providing you such content! Stay tuned :)
All the best...Keep learning :)
Thanks ..truely appreciable
Thanks a lot buddy... :)
As Usual
You are Awesome .
As usual..
Thanks a lot buddy for your appreciation :D
All the best....Keep learning :)
It is Nice Tutorial. Thanks for the upload
Thank you for your appreciation.. :)
Amazing..!!!thanku so much
Thanks :)
Awesome writing
what is intermediate vertices in this algorithm and also also clear my confusion if any weight in negative so cannot take this edge
Nice video sir
Thank u sir... Bt sir it will be better if u will explain wid formulas...
Thanks for your feedback buddy...But this video was especially created keeping in view the shortcut!
I hope it was helpful...Keep learning :)
Can you please make more two videos on travelling salesman problem and reliability design using dynamic programming??
Hey buddy...I will definitely try recording these videos too asap!
Stay tuned...!
All the best...Keep learning :)
Thank you very much!! :) :)
Yes pls upload it dear
Thank you so much... Best video...
Thanks a lot buddy for your appreciation :)
We will keep working hard to make the content available to you people!
All the best...Keep learning :)
Just awesome....
Woah.. superb
Thanks. It is helpful.
Bhai awesome video and please make a video on binomial coefficient computation through dynamic programming .
Hey buddy...Thanks a lot for your appreciation! I will definitely try to make the video available soon...Stay tuned! All the best...Keep learning :)
LearnVidFun please bro make the video on this topic as soon as possible
m
Thankx.....Its very useful.
Thanks a lot...please share with your friends!All the best :)
Easiest one thank you
Glad to help you dear!
All the best...Keep leaning :)
nicely explained..keep it up!!
Sir all videos are very good and I need bellman ford and 0/1knapsack of dynamic programming please help me thanks for all video's
Hey dear...0/1 knapsack using dynamic programming approach video is already available...Please check the Algorithms playlist!
Bellman ford algorithm will be made available soon!
Keep learning :)
Thank u so much Sir....
Happy to help you buddy!!
All the best...Keep learning :)
Thank you so much sir
Keep learning...All the best :)
Thanks friend 🤗
Good hand writing
Thnk u bro 😊
Happy to help you buddy....!!
Stay tuned by subscribing yourself to watch more videos!
All the best...Keep learning :)
last matrix D4 mai element ki value kya signify kr rhi hai?.....i am thinking,it is the length of path between corresponding vertices.......
Yes buddy...You are right!
The algorithm outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix.
Thanku so much......god bls u
Glad to help you dear!
All the best...Keep learning :)
Very Nice Videos
damn it man! u nailed it. loved this video . u have no idea how helpful it is or i guess u know it already but fuck it. good work and thanx.
Thanks a lot for liking it....Keep learning...All the best :)
Very Nice Video
bhai efforts bohot dale hai heading likhne ke liye.😊
Nice brother ❤️
good job
Thanks... :)
where is shortest path ?
thanks so much
Keep learning :)
Is this Algorithm necessary for us to read? Can we skip it?
What was the sequence of filling data
awesome
Thank you.. :)
good explantation
Thank you...Keep learning :)
sir please make a video 0/1 knapsack problem
I have already uploaded a video on 0/1 knapsack problem...Kindly check the playlist :)
again nice one
Thank you... :)
can we check the answer of it is it wrong or right?
nice 1
Thank you :)
Keep learning :)
Bhai ye shortcut kya selfloop wale element mai sahi ans dega?? Kyuki mene check kia is shortcut nd using formula wale ans alag alag aa rhe hai.... Plzz help fast...
Thanks😊😊😊😊😊😊😊
Happy to help you...All the best...Keep learning :)
sir I want a video for master theorem if you give early then it is very helpful exam because my semster is very near
Hey buddy...I will soon make available the video of Master Theorem!
All the best...Keep learning...stay tuned :)
please upload algorithms of this problem
Hey dear...Thanks for liking the videos...I will soon try to make available the algorithms too!
bellman ford algorithm in dynamic programming problem please solve this problem its very urgent sir
Hey dear...I will definitely try to upload a tutorial on it soon :)
All the best..Keep learning :)
deliver the lectures in english .so that every one can watch....
Thank you so much for watching and liking the videos! :)
not able to find the handwritten notes in your website
how to check the table of d2 and d3
saved semester
Happy to help you!
All the best...Keep learning :)
Very nice. But, too slow....
Thanks a lot dear for your appreciation :)
Regarding the slow speed, you can increase the speed of the video by changing the settings!
I hope that was helpful :)
All the best...Keep learning :)
Right ☺☺☺☺☺
If no one node coming towards node then all element in column1 having infinity except 1 then hiw to solve it
Please reply as soon as possible
you are excellent boy
Thanks buddy :)
Bruh, that handwriting should be in Microsoft Word next version!
Woow...thank you so much for such a nice compliment :)
sir agar mai dusri example krti hu toh solve nai hota abh kya kru sir
Which example are you trying?
dance
Apne gate qualify Kiya h kya.....kuch tips do bro...
Thanks buddy for suggesting the topic!
We will be back soon with some powerful tips for cracking the exam!
Stay tuned by subscribing yourself to get the notification :)
All the best...Keep learning :)
it's an Shortest path problem but where is shortest path ? how to find it
The algorithm actually outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix.
However, with little modifications in the code, you can get the desired path.
I hope you got the answer to you query :)
Ismein shortest path konsa hua ab sir ?
The algorithm actually outputs the least cost of the path between the two desired vertices for every two pair of vertices and not the path itself. That's why, the result is represented in the form of a matrix.
However, with little modifications in the code, you can get the desired path.
I hope you got the answer to you query :)
it would b better when u exllained only in english
Thanks for your consideration! I try to make the videos meaningful for both hindi and english students!
thiya miya we cant understand
2x par dekh lo
Please English
for better understand
Thank you so much sir
awesome
Thank you.. :)
awesome
Thanks buddy...
Keep learning :)