采用遗传算法和暴力破解两种方法求解10城市旅行商问题（TSP）-To solve 10 cities Traveling Salesman Problem with Genetic Algorithm and in a violent way separately

数据挖掘Aprior的简易c++实现，通过string来表示数据集，没有采用STL set集合操作，因此实现起来简单一些，判断是否包含用到了动态规划算法中的最长公共子序列，思想是暴力求解，没有用到很高端的思想和算法。(Simple c++ data mining Aprior, said data set by the string, without the use of STL set collection operation, thus the realization is simple,

模拟退火，遗传算法，神经网络程序高级算法的简单运用，是有效的计算出最优的方法，相比于暴力搜索，算法简洁，运行时间短(The application of simulated annealing, genetic algorithm and advanced algorithm of neural network program is the best way to calculate effectively. Compared with violent search, the algorithm