Code in java for the Traveling salesman problem. This code is very simple becaus...

利用c++实现遗传算法的求出程序的优化设计-use genetic algorithm calculated the optimal design procedures

此程序可以计算 1-D 样条函数。用户可以把一些已知的 1 D 数据、 和内插的值可以由惩基于样条函数计算。

Lu分解求解矩阵，现在比较少用 fortran 程序。 所以比较难找，希望能给用 fortran程序的同行带来方便。-Lu decomposition solving matrix, is now less used fortran program. Therefore, comparison was difficult to find, hope that I can use fortran program peer convenience.

给出了分形计算生成动态树的VC＋＋源代码。生长出来的树摇曳而逼真。-Gives the fractal calculation generate dynamic tree VC source code. Grow trees swaying and realistic.

零树编码源码-Zerotree coding source

基于STM32单片机的智能家居控制系统，本作品有单片机控制模块、GSM模块、继电器控制家电开关模块、传感器模块等，嵌入了uc/os II实时操作系统，使得系统运行更加稳定、高效和可靠，体现了当今“绿色环保”的理念，“人性化”的设计更给用户一个舒适的感觉。

求树的层次的算法-level for the tree algorithm

无递归二叉树插入及中序等顺带求得深度等-Non-recursive binary tree insertion sequence, such as passing and seek depth

回溯法的m着色问题，用bool方阵（方阵阶数表示点数）表示两点是否邻接。结果实现出所有颜色数小于m的着色方法-retroactive law m coloring problems, bool Matrix (Matrix said the order points), whether adjacent 2:00. The results achieved in all colors of a few less than the colored m

自适应矢量化算法（VQ）源程序VQ-adaptive vector algorithm (VQ) source VQ