文件名称:dynamic programming
介绍说明--下载内容来自于网络,使用问题请自行百度
设平面上有一个m×n 的网格,将左下角的网格点标记为(0,0)而右上角的网格点标记为(m,n)。某人想从(0,0)出发沿网格线行进到达(m,n),但是在网格点(i,j)处他只能向上行进或者向右行进,向上行进的代价为aij(amj =+∞),向右行进的代价是bij(bin =+∞)。试设计一个动态规划算法,在这个网格中为该旅行者寻找一条代价最小的旅行路线。(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.)
相关搜索: dynamic programming
(系统自动生成,下载前可以参看下载内容)
下载文件列表
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
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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.