搜索资源列表
mutigraphy
- 用动态规划法来解决多段图问题，显示邻接矩阵，显示最后的决策与最小代价
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
bag1
- 用动态规划法解决0/1背包问题，上传的是源码，经调试可以运行-use dymnamic Programming answer the knapsack problem
DijkstraTest
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to
Backpack_01
- 动态规划法实现0-1背包，分析存储矩阵中的填充部分。-The dynamic programming method to achieve the 0-1 knapsack padding in the memory matrix.
MatrixMultiply
- 算法分析与设计 用动态规划法计算矩阵乘积（java源码）-Algorithm Analysis and Design Matrix Multiply with Dynamic Programming Method. (Java source code)