An Initiation of Dynamic Programming to Solve the Graphical As Well As Network Problems for the Minimum Path Between Nodes
Manish Jain, Adarsh Srivastava, Anand Kumar Dixit, Somnath Ghosh · Oriental journal of computer science and technology · 2011
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