搜索资源列表
MatrixDynamicMulti
- 用动态规划实现矩阵链乘的java代码-Dynamic Programming Matrix chain by the java code.
mutigraphy
- 用动态规划法来解决多段图问题，显示邻接矩阵，显示最后的决策与最小代价
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
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.
Fibonacci
- （1）编写一个矩阵操作类库，具体实现要求如下： 实现构造函数动态创建不同大小的二维矩阵m*n 实现函数完成两个矩阵的相加、求差与矩阵各个元素相乘运算； 实现函数可以得到矩阵中指定元素数值。 （2）Fibonacci数列是一个自然数数列，第1项和第2项均为1，从第3项开始,F(n)= F(n-1)+ F(n-2).定义一个数组，前两个元素初始化为Fibonacci数列的第1,2项，求出数列的前20项。-(1) the preparation of a matrix operati
MatrixMultiply
- 算法分析与设计 用动态规划法计算矩阵乘积（java源码）-Algorithm Analysis and Design Matrix Multiply with Dynamic Programming Method. (Java source code)
Matrixchain
- 矩阵链乘法，采用动态规划，使用java编写。-Matrix-chain Question
java2
- 常用的程序总结，主要是动态规划的算法，有斐波拉契，矩阵，背包，和二叉查找树-Summary of frequently used programs, mainly dynamic programming algorithm, Feibolaqi, matrix, backpacks, and a binary search tree
F_JIDtjl
- 模糊聚类分析动态聚类图，R模糊相似矩阵求传递闭包-Fuzzy cluster analysis of dynamic clustering diagram, R fuzzy similar matrix transitive closure of
矩阵连乘问题和租船问题
- 动态规划算法解决矩阵连乘问题和租船问题，java源码。(Dynamic programming algorithm to solve matrix multiplication problem and charter problem, java source code.)