搜索资源列表
subsetcalculator
- 本算法实现2-10集合划分问题,采用动态规划法和大整数方法-the algorithm 2-10 set partition, using dynamic programming methods and the Integer
动态规划123
- 本程序是用动态规划法来解决一些问题,关于动态规划的程序-this program is the dynamic programming method to solve the problem of dynamic planning process
动态规划-航线设置
- 动态规划法---如何设置友好城市间的航线使的航线数又最大又不相交-dynamic programming -- how to set up a sister city links are so few routes do not intersect also the largest
动态规划法解决矩阵连乘积问题
- 这是一个小弟用动态规划法解决矩阵连乘积问题的一个算法。-This is a younger dynamic programming matrix to solve even the product of an algorithm.
动态规划----矩阵连乘问题
- 动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3）下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic prog
背包问题的动态规划法算法(c++)
- 数据结构 算法设计与分析背包问题的动态规划法算法-data structure design and analysis of algorithms knapsack problem of dynamic programming algorithm
0-1背包问题
- 动态规划法解决0-1背包问题
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law
liushuizuoye
- 这是基于VC++的一个简单的流水作业程序(动态规划法)-This is based on the VC a simple routine procedure (Dynamic Programming)
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
suanfafenxi
- 五个经典的算法分析中的算法及例题，涉及到递归法、回溯法、动态规划法等经典算法-Analysis of the five classical algorithm and the example of the algorithm involves recursive law, retroactive law, such as the classic dynamic programming algorithm
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
longest
- 算法分析中动态规划法的经典例子，最长公子序列问题。VC++编写的C源码-Algorithm analysis, a classic example of dynamic programming, the longest sequence of the problem son. VC++ source code written in C
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
最长递增子序列
- 利用动态规划法求出，时间复杂度为O(N*2)
dynamic
- 用动态规划法求0/1背包问题的最优解 数值与函数可以自行修改(Solving the optimal solution of 0/1 knapsack problem by dynamic programming Values and functions can be modified by themselves)
Maxsum
- 用蛮力法、分治法、动态规划法实现最大子段和(There is MaxSums in three way.)
动态规划算法源程序1
- 基于动态规划算法编写的程序，具有一定的借鉴意义。(he program based on the dynamic programming algorithm has certain reference significance.)
动态规划法
- 动态规划法寻找最短路径，用MATLAB实现编程(Dynamic programming is used to find the shortest path and programmed by MATLAB.)