利用杜利特路分解求解线性方程组！

资源描述这是关于动态规划的一个问题，一般称之为最长公共字串问题，但是在这里采用了Java语言来进行实现，可以帮助我们更好的理解动态规划这个经典算法

卡尔曼滤波的基础算法,对初学者有很大的帮助-Kalman filter-based algorithm, there is a great help for beginners ...................

3D克希霍夫偏移程序。利用c语言编写的三维迭前偏移的代码，算法结果正确，精度高，具有很好的实用性-The use of three-dimensional Diego c language code before the cheap, algorithms result is correct, high precision, with a good practical 

program compare files in 2 directories. argv[1/2] - folder_1/2, argv[3] - file with result

基于多项式的矩阵积分-polynomial matrix-based Integral

离散数学重言式判别以及逻辑表达式求值原代码-Discrete Mathematics tautology discriminant and logic expressions evaluates the original code

高斯正算坐标程序计算高斯投影的正算问题克拉索夫斯基椭球-Gaussian count is calculated coordinates of the Gaussian projection is counting police used batons for dispersing ellipsoid

  编写程序，在菜单列表框中选择多本图书，单击’提交’按钮,输出用户的选择值。初学者可以看下

K均值聚类算法源代码-K-means clustering algorithm source code

C语言作的四色验证1．需求分析问题描述：证明了可以用不多于4种颜色对n个区域着色，而满足相邻的区域具有不同的颜色输入形式 ： 暂定最多50个区域，如需证明更多区域，修改#define S 50 即可；以整形形式输入（取值范围1-32767）用户需要证明的区域数目，相联的一对矩阵； 输出形式：以0和1输出关联矩阵，和以blue yellow orange pink形式输出每个区域相对应证明出的颜色；-C language does four colors confirm 1. demands analyses question description: Had proven may use not to be many to 4 kind of colors to n region coloration, but satisfies the neighboring region to have the different color input form: Establishes provisionally more than 50 regions, if must prove more regions, revise#define S 50 then; Region number (value scope 1-32767) the user needs to prove which by the reshaping form input, unites a pair of matrix; Output form: By 0 and 1 output incidence matrixs, with form outputs the color by blue yellow orange the pink which each region corresponds proves;