运用java做的矩阵连乘，有界面，是一个曾经的课程设计来的。-Matrix using java to do with multiplication, there are interfaces, is a course designed to have the.

一些经典算法的java实现：包括：二分查找，最优二搜索树，编辑距离，哈夫曼树，最长公共子序列，矩阵连乘问题，最短路径优先-Some classic algorithm java implementation: including: binary search, and optimal two search tree, the edit distance Huffman tree, the longest common subsequence matrix multiplicative Short

实现矩阵连乘算法，求出最优值及一个最优解。-Even realize matrix multiplication algorithm, find the optimal value and an optimal solution.

给定n个矩阵{nAAA ,2,1}，其中iA和1 iA是可乘的，i=1,2,…,n-1。考察这n个矩阵的连乘积nAAA ,2,1。由于矩阵乘法具有结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。-Given n matrices {nAAA  , 2,1}, and 1  iA iA which is multiplicative, i = 1,2, ..., n-1. Examin

动态规划算法解决矩阵连乘问题和租船问题，java源码。(Dynamic programming algorithm to solve matrix multiplication problem and charter problem, java source code.)