I think you should start teaching teachers how to teach.

Sir, may you have the most wonderful life ahead. We need more professors like you.

the best videos on DP. You have a great charisma. Thank you for all your videos.

The reason the books are messed up and so confusing is because they start at the formula that you described at 16:47 haha. Thank you for your patient teaching sir. You rock!

Your explanation on the topic of multistage graph really helps me understand the topic better. I really like your approach to explaining the topic, where you explain the topic using an example first, then give the formula afterward. This helps me understand the concept instead of just following a formula. Your explanation makes this complicated topic look so simple, thank you for your clear explanation!

Sir your explanation was very simple, to the point and easy to learn. Thank you for making dynamic programming easy and fun😀

I've got my degree, because of people like you sir! Thanks a lot!

This is possibly the best video to watch and understand multistage graphs. Thank you so much!

Another excellent video. It's really amazing how you can explain the process of solving multistage graphs with ease. The way it uses dynamic programming as the forward technique to solve the problem has got to be my favourite.

How much do I wish you were my algorithm professor...you explain things in such a clear and precise manner. It is an art

Sir you are awesome, great, explain actual algorithm problems.. actually helpful..

Algorithms is such an interesting subject to explore. It disappoints me greatly how little passion my lecturers seem to have for teaching it. During the corona virus lockdown they abandoned us students (they did not organize any online activity or chat) and did not provide us with any materials to study from or upload any videos (all we had were the presentations which naturally had little to no information in them). Not that they were very good teachers in the first place. Regardless, thank you for these wonderful videos!

Thanks to you and your videos I was able to approve Programming 3! I'm glad of finding your channel on KZfaq.

Probably the clearest explanation on Multi Stage Graphs out there. Much easier to understand than ones that use too much technical jargon.

Superb sir..you have taught the multistage graph very easily..Thank you

Wow... Amazing crystal cleared sir, huge respect.. 🙏🙏🙏🙏

Thank you for the clear explaination on Multistage Graph sir Abdul! This helps me to understand the topic a lot better, especially on the part where you show us the example first and then the formula. It’s very detailed yet its not making the topic becomes complicated, instead, it becomes simpler. Thank you sir!

sir we are expecting network flow algorithm for you hopefully we would be waiting for it, most of the students from our collage were following your lectures and your teaching is simply awesome

One of the best explanation available on internet.

you always give clear explanation, the topics in your videos are easy to understand. and i appreciate you drawing the graphs since it's super helpful

you explained the complex concept so easily. a lot of respects Sir

Sir your way of explaining methods is too good.... I have to cover the whole syllabus of daa within 2 weeks and following your lectures,I think i can do it.... Thank u soo much sir for putting so much efforts for us....

Many of the cuts are horrendous, but you make absolutely up for it by being splendid! Thanks a lot sir for the great, clear explanations.

me kafi time se dhoondh rha google, YT pr graph modelling kya cheej h, GS coding round me aai thi cost and graphs related.............. finally ye video mili.....and dil ko sukoon bhi

This video cleared up the couple of things I had a hard time understanding. Your explanations are very easy to understand.

Thank you so much for the lecture sir, your videos are really helpful especially because you give detailed and easy to follow explanations. My favorite part is when you explain about the shortest path with forward method vertex by vertex. It helps a lot!

Thank you, sir. Your explanation is really clear about the multistage graph where you teach from the basics of how to do the table, the formula, and the sequence of decisions because it is needed in dynamic programming .

Thanks for explaining it in the best way :)

Peaceful explanation 😃

Thank you sir for the clear explanation, Sir! I like how you gave the formula after you had explained the steps with the graph and table, instead of giving it right away at the start. I also understand better how dynamic programming works in this multistage graph because you emphasized it at the end.

Thank you sir for this. Your teachings are always straightforward and understandable :)

Thanks for the lecture on the multistage graph topic. your videos are always clear and easily understandable and the examples you provide helps me understand the topic even furhter

Thank you sir for the clear explanation. Because of this video I now understand better about dynamic programming and multistage graph specifically. I really like how you explained it by walking us through all the steps with simple examples which makes it easy to understand.

great explanation as always sir, I really like when you explain it while giving us examples so we can understand it better 👍

Thank you sir! A very elegant demonstration of Dynamic Programming and path storing. It was also very cool how you derived the formula from the process you already did, makes it so much more intuitive than just a bunch of fancy letters. Math would've been so much easier if it followed this teaching style :P

The explaination is very clear, the textbook formula makes it really confusing, but the way you explain it makes the formula make sense.

Thank you sir..it's very useful & I understand clearly..way of ur teaching is very nice

DAA Ki devudu sir meru 🙏🙏

Very clear and concise explanation as always. Made me really understand more about how to obtain the formula with the way you teach. Thanks.

This video is very helpful, Although at first i was intimidated by the graph, at the end of the video I understand how to solve a problem like this. I liked how after the example, you gave the equation and explained clearly what the symbols are, which was very easy to understand since you started with the example first, hence not intimidating people with a sudden equation that they may or may not know where it came from. Thank you for the great explanation sir.

extremely crisp and clear. very easy approach. Thank you so much..

Thank you for your detailed explanation; it helped me understand the process.

I don't have such a beautiful words to introduce the beauty of your teaching I love you my respected sir ❤️❤️❤️

very helpful.... excellent presentation...........thank you :)

Thank you so much..It is very helpful... is this method applicable to other directed weighed graphs such that vertex 1 is directly linked to vertex 6 for example (stage 1 to stage 3)? if i want to use the dynamic programming strategy to solve the shortest path problem for a given graph... is that all the problem can be presented as multistage (example of graph your video 3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy method) Otherwise what is the best algorithm using DP to solve single sorce shortet path?

I was afraid of data structure but now it's toooo easy just bcz of u

sir u donno but ye videos humm jaise students li life changing hoti hai

The video provide a very clear explanation about the problem and solution. Every minute I spend watching is very insightful. Thank you for making this video sir!

Thanks for giving away such an informative video for free!

Thank you sir, appreciate you a lot.

thanks sir ,you have explained very easily and very well !!!!!!

Your videos are priceless! Much gratitude!

Thank you sir, your teaching is excellent.

A very good explanation sir. I like how simple you explain the steps to get the formula.

Amazing lecture dear sir!

Thank you sir for explain actual algroithm

The explanation is very easy to understand. Very helpful video for a computer science student like me. Thanks a lot sir!

You are great tutor for beginners Now I am clear with the algorithm concept

Your video is very helpful, sir! it's clear and simple. The explanation for each steps are very detailed and it's easy for me to understand, thank you sir.

Thank you sir you explained very well.it is very helpful for me

if there is additional cost on each node, such as time to spent on the node, how to solve it? what if the time is unknown but you want the shortest path and least of total time?

Abdul guru ji. You are the best teacher that I have seen so far.

I Luv it. Your way of teaching sir...

Amazing explanation Sir...needed to cover this portion and a few others for my upcoming exam at IIM Calcutta. You made sure I'll never forget these concepts in this lifetime!

Thanks sir for making great videos.You are simply genious.

Thank you, sir, for the explanation. I really like your explanation it was very simple and straightforward. It helped me understand this topic better.

Great lecture, Sir. Thanks 🥊

I was finding it hard to visualize any problem in terms of Dynamic Programming technique as I was not able see how a problem 1. has an optimal substructure 2. has overlapping subproblems that are two criteria for a problem to identify that it could solved through dynamic programming. This presentation indeed has added a lot of value in terms of clarifying some of my confusions. The description of the function to find the optimum solution in the end of the video has been a lot of help as I could read a lot of such statement in many other sources but was not able to relate them overall in my thinking or analysis of the problem solving process. Explanation is of the highest quality, being clean and precise. Thank you very much!

good explanation sir..thank you

simple yet very easy to grasp, thank you sir!

Just no words for the great explanation. Thank you very much 🙏

sir gd explanation sir .ur way teaching is im undstnd sir tq vry much sir🙏🙏🙏🙏🙏🙏

That's sooo clear! Thank you sir and thank you for all your videos!

Thank you for this sir, your teaching is straightforward and easy to understand.

Excellent explanation of the Concept.

Great explaination by this guy👌👌👌👌👌

I just love you.. Like seriously you the best

Sir this multiple stage graph may also possible in backward then we use the same formula...for solving in backward

Thanks a lot sir! Great explanation

In any stage (say stage-3), would edges be allowed between vertices 6 to 7 and/or 8 to 7 ?

you explain this by far better than this MIT guy. Thank you sir. Adblock off only here :)

I have seen people in the comment section mentioning other ways to solve the problem.With an attempt to further clarification.I have attempted filling the table from the source and got exactly the same result.And to those mentioning that it is easier using Dijkstra, I agree, but Dijkstra is going to take slightly more time considering the additional updations required for each node, oterwise it is just fine.

Thanks very much for your immediate reply.

Excellent explanation. Doing good job.

Thanks u so much sir..It is very helpful...

thank you so much sir your videos helped me a lot

great explanation. very easy method. pranam sir.

Thank you for the video, it was very clear and help me understand this topic better.

sir, ur explanation is rod.you r making simple problem into complex with your way of explanation.

still the best tut among other KZfaqr explanations

thank u so much sir...plz start lecture on python and android also

a gold mine in KZfaq.

First I thing this program is very difficult to understand , after I saw ur lecture i can solve the problem

Excellent sir..Best explanation given by you sir.Thank you sir.

Thank you sir. Very good videos. Keep making videos like this.🙏🙏🙏🙏🙏

Amazing explanation sir, it helps me to understand the concept of this topic 👍👍

Astonishing video sir, thankyou for providing a video on this topic.

sir how to draw this graph when given problem is of set bulider form plz reply soon

Sir if there is a path from i th stage to (i+2) th stage will it be still a multi stage graph and can we solve it by dynamic approach?

Is possible to apply this dp to a maze? Specially a weighted maze with more than one path. Or would be a case for bfs.