Description: There is a m * n mesh on the plane, and the grid point on the lower left is marked (0,0), and the grid point on the upper right is marked as (m, n). Want sb (0,0) starting from marching along the mesh line at (m, n), but in the grid point (I, J) where he can only travel up or to travel on the road to the right, the price for AIJ (AMJ = 2), the road to the right is the price of bij (bin = 2). A dynamic programming algorithm is designed to find the least cost travel route for the traveler in this grid.
To Search:
File list (Check if you may need any files):
Demo2
Demo2\.classpath
Demo2\.project
Demo2\.settings
Demo2\.settings\org.eclipse.jdt.core.prefs
Demo2\bin
Demo2\bin\DynamicProgramming
Demo2\bin\DynamicProgramming\DynamicProgramming.class
Demo2\src
Demo2\src\DynamicProgramming
Demo2\src\DynamicProgramming\DynamicProgramming.java
Download