浏览文件夹类型,监控指定文件夹下的文件,实现文件监控

Serial Communication Source

实现约瑟夫环编程，且过程清晰，可以看到每一步的执行情况！-Joseph Central programming implementation, and the process clear, we can see the implementation of each step!

机器学习及人工智能中的多层感机的算法，可识别复杂的二维点阵图形，在实际的模式识别中很有参考价值。-Machine study for arithmetic multi-layer perceptron, it can recognize 2D dot matric graph, it is a good reference for pattern recognition

金远平数据结构答案金 远平数据结构答案金 远平数据结构答案金远平数据结构答案v-The Key of JYP

闹钟程序，比较简单，中午和下午各提醒一次，时间请有需要者自行在程序里改-alarm procedures are relatively simple, at noon and in the afternoon to remind a time please those who need to change the program

这个是旅行查询系统，模拟查询旅游路线。欢迎使用，希望大家提供意见。-This is a travel query system, simulating travel route inquiries. Welcome, I hope to advise the U.S..

公共子序列问题的KMP算法 很厉害的阿斯蒂芬身份的身份-The issue of public sequence KMP algorithm is very powerful in his capacity as the identity of阿斯蒂芬

good - This program has its own library file swap.h. You can use this file to swap the values in any 2 variables.-good- This program has its own library file swap.h. You can use this file to swap the values in any 2 variables.

自定义 CRichEditCtrl 控件》配套代码-Chars from the definition of control "complementary code

遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.