In rod cutting, we can take the same length more than once, which is not the case with the 0/1 knapsack problem, we can't take the same elements more than once
Not exactly. I had a little example with the greedy algorithm at the beginning of the video and argued it is not always optimal. The Backward Pass/Recursion is always optimal. They seem like they are the same but not really since for BR, we need to solve the nested value functions of each node. 😊
Explainism of Shortest Path problem was wonderfull.
Great explanation of the concept. Thank you.
great tutorial sir! thanks. 😊
Sir also make a video on forward recursion approach
Hi what are the tools you have used to create this vedio with shortest path ?
Is there any software that can does backward recursions of dynamic programming sir?
Rf7e9
Sir the ans is 21 is correct?
A->2->4->B I.e 2+4+15=21
What is difference between rod cutting and 0/1 knapsack problem?
In rod cutting, we can take the same length more than once, which is not the case with the 0/1 knapsack problem, we can't take the same elements more than once
Give tutorial or solution source of try this problem
what is the answer of the given problem . is it 11
No forward pass recursion
Is this greedy, but going from the end to the beginning?
Not exactly. I had a little example with the greedy algorithm at the beginning of the video and argued it is not always optimal. The Backward Pass/Recursion is always optimal. They seem like they are the same but not really since for BR, we need to solve the nested value functions of each node. 😊
A-2-3-5-7-B is the shortest path and it’s weight would be 19. Is that correct?