搜索资源列表
bagprogram
- 用动态规划来解0-1背包问题的算法思想及程序代码-use dynamic programming solution to the 0-1 knapsack problem algorithms and code thinking
03113111
- 动态规划 矩阵连乘问题 算法设计与分析 练习题 -dynamic programming matrix continually multiply problems algorithm design and analysis Exercises
BestBST
- 该源程序是用动态规划算法求解最优二叉搜索树问题-the source is dynamic programming algorithm for optimal binary search tree problem
01beibao
- 0-1背包问题,用动态规划算法来实现的.-0-1 knapsack problem with dynamic programming algorithm to achieve.
0-1Pack
- 用C#写的《计算机软件算法分析与设计》的作业--动态规划算法，0-1背包问题 可选择背包容量（浮点型）和指定每个物品的重量（浮点型），生成物品选择表和统计信息
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
EditDistance
- C#的计算编辑距离的代码。可指定需要计算的区间以及操作代价函数。算法用动态规划方法实现。-C# Edit distance calculation code. Calculation required to specify the range and operating cost function. Algorithm using dynamic programming method.
dongtaiguihua
- 算法设计课程设计中的动态规划算法的c++代码实现-Algorithm design in the curriculum design of the dynamic programming algorithm c++ code to achieve
LDCshape
- 用动态规划算法思想求最小编辑距离用C#实现-distanse
Activity-selection-problem
- 活动选择问题，递归算法和动态规划，实现在一定的时间里最合理的活动安排，供算法学习用-Activities selection problem, recursive algorithms and dynamic programming to achieve the most rational activities arrange in a certain time, for the algorithm to learn
main
- 算法课程序--动态规划的实现，程序可以运行通过-algorithm program
The-shortest-path
- 用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
C-yuyan
- 基于C语言的一些算法分析及实现，主要有动态规划，分治，搜索算法等-Some algorithm analysis and implementation of C language based mainly on dynamic programming, divide and conquer, the search algorithm
include
- 1）编程递归实现0-1背包问题并回溯求出问题的解向量（即X[N]的值）和多段图的最短路经问题的动态规划算法。 2）图的数据结构采用邻接表。 3） 要求用文件装入5个多段图数据，编写从文件到邻接表的函数。 4）验证算法的时间复杂性。 5）0-1背包问题的实验数据见实验二的背包问题数据。 -1) programming recursive implementation of the 0-1 knapsack problem and backtracking to solve th
zuidaziduanhe
- 给定整数序列，用动态规划算法求出最大子段和，用c语言实现-Given the sequence of integers, find the maximum dynamic programming algorithm and sub-segment, with the c language
flowshop
- 流水作业调度问题的动态规划算法,流水作业调度问题要求确定这n个作业的最优加工顺序,使得从第一个作业在机器M1上开始加工,到最后一个作业在机器M2上加工完成所需的时间最少。- Dynamic programming algorithm for flow shop scheduling problems, flow-shop scheduling problems required to determine the optimal processing sequence which n jobs
水库调度POA
- 水库调度POA算法，动态规划的改进方法。(POA algorithm for reservoir scheduling)