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 programming provides a useful way to find out the minimum distance between the two nodes within the network.The multistage decision policy with recursive approach will provides an efficient way while using Dynamic programming. In multistage decision process the problem is divided into several parts called as sub problems and then each sub problem will be solved individually and the final result will be obtained by combining the results of all the sub problems.