"Algorithm design and analysis" by wang xiaodong, chapter 3 dynamic planning, textbook example code implementation

Filename	Size	Update
3.8 流水作业调度\说明.txt	141	2006-02-28
chees.java	1868	2006-02-22
3.6 图像压缩\Compress.java	1683	2006-02-26
3.8 流水作业调度\Element.java	326	2006-02-28
3.8 流水作业调度\FlowShop.java	913	2006-02-28
3.9 0-1背包问题\教材P93~P94的算法\Knapsack.java	1854	2005-02-28
3.9 0-1背包问题\教材P96~P97的改进算法\Knapsack2.java	2508	2005-02-28
3.3 最长公共子序列\Lcs.java	1260	2006-02-26
23.1 矩阵连乘问题\用动态规划法计算最优次序\MatrixChain.java	1253	2008-10-07
23.1 矩阵连乘问题\2个矩阵相乘的标准算法\MatrixMultiply.java	1053	2006-02-26
73.2 基本要素\备忘录方法\MemorizedMatrixChain.java	1057	2006-02-26
3.8 流水作业调度\MergeSort.java	1665	2006-02-28
3.4 凸多边形最优三角剖分\MinWeightTriangulation.java	1740	2006-02-26
3.7 电路布线\MNset.java	1240	2006-02-26
53.10 最优二叉搜索树\教材P100~P101的改进算法\OBST.java	1542	2005-02-28
53.10 最优二叉搜索树\教材P99~P100的算法\OptimalBinarySearchTree.java	1539	2005-02-28
3.5 多边形游戏\PolyMax.java	1293	2006-02-26
73.2 基本要素\用递归算法计算矩阵连乘积最优计算次序\RecurMatrixChain.java	1229	2006-02-26
3.9 0-1背包问题\教材P93~P94的算法\Knapsack.class	2285	2008-11-27
3.9 0-1背包问题\教材P96~P97的改进算法\Knapsack2.class	2697	2008-10-11
3.3 最长公共子序列\Lcs.class	1708	2008-11-27
23.1 矩阵连乘问题\用动态规划法计算最优次序\MatrixChain.class	1675	2008-11-27
23.1 矩阵连乘问题\2个矩阵相乘的标准算法\MatrixMultiply.class	1411	2008-11-25
73.2 基本要素\备忘录方法\MemorizedMatrixChain.class	1449	2008-11-27
23.1 矩阵连乘问题\2个矩阵相乘的标准算法
73.2 基本要素\备忘录方法
53.10 最优二叉搜索树\教材P100~P101的改进算法
3.9 0-1背包问题\教材P93~P94的算法
3.9 0-1背包问题\教材P96~P97的改进算法
53.10 最优二叉搜索树\教材P99~P100的算法
73.2 基本要素\用递归算法计算矩阵连乘积最优计算次序
23.1 矩阵连乘问题\用动态规划法计算最优次序
23.1 矩阵连乘问题
53.10 最优二叉搜索树
73.2 基本要素
3.3 最长公共子序列
3.4 凸多边形最优三角剖分
3.5 多边形游戏
3.6 图像压缩
3.7 电路布线
3.8 流水作业调度
3.9 0-1背包问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．