An Initiation of Dynamic Programming to Solve the Graphical as well as Network Problems for the Minimum Path between Nodes

摘要

Dynamic programming is a useful technique for making a sequence of interrelated decisions.It provides a step wise procedure for finding the optimal combination of decisions. Dynamic programmingprovides a useful way to find out the minimum distance between the two nodes within the network.Themultistage decision policy with recursive approach will provides an efficient way while using Dynamicprogramming. In multistage decision process the problem is divided into several parts called as subproblems and then each sub problem will be solved individually and the final result will be obtained bycombining the results of all the sub problems