关于图分割的动态规划问题，求图内分割弦长度的最小和-a dynamic algorithm based on graph splitting

经典的基于GA遗传算法的路径规划问题的实现，能动态的实现所需功能，值得学习研究-The path planning problem of GA based on genetic algorithm classic, can realize the dynamic functions are required, it is worth learning research

利用动态规划算法的优点，使用一种基于行列动态规划的自适应立体匹配算法，采用自适应代价函数和能量最小化模型，对最优化问题进行求解。-Take advantage of the dynamic programming algorithm uses an adaptive stereo matching algorithm based on dynamic programming ranks, adaptive cost function and energy minimization model f

dp问题的讲解,动态规划的定义应用等等,主要对于竞赛做题的应用,()